Efficient chaining of seeds in ordered trees

Autor: Allali, Julien, Chauve, Cédric, Ferraro, Pascal, Gaillard, Anne-Laure

Publikováno v: 21st International Workshop on Combinatorial Algorithms, London : United Kingdom (2010)

We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natura

Externí odkaz: http://arxiv.org/abs/1007.0942

A constrained edit distance algorithm between semi-ordered trees

Autor: Ouangraoua, Aïda, Ferraro, Pascal

Publikováno v: In Theoretical Computer Science 2009 410(8):837-846

Optimal mappings with minimum number of connected components in tree-to-tree comparison problems

Autor: Ferraro, Pascal, Godin, Christophe

Publikováno v: In Journal of Algorithms 2003 48(2):385-406

Toward a General Framework for Polyphonic Comparison.

Autor: Allali, Julien¹ julien.allali@labri.fr, Ferraro, Pascal² pascal.ferraro@labri.fr, Hanna, Pierre¹ pierre.hanna@labri.fr, Iliopoulos, Costas³ costas.iliopoulos@kings.uk, Robine, Matthias¹ matthias.robine@labri.fr

Publikováno v: Fundamenta Informaticae. 2009, Vol. 97 Issue 3, p331-346. 16p. 6 Diagrams, 3 Charts.

Exemplar-based Imputation of Large Missing Audio Parts Using String Matching on Tonal Features

Autor: Martin, Benjamin, Hanna, Pierre, Ta, Vinh-Thong, Desainte-Catherine, Myriam, Ferraro, Pascal

Publikováno v: 12th International Society for Music Information Retrieval Conference
12th International Society for Music Information Retrieval Conference, Oct 2011, Miami, United States. pp.507--512

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4a1274b5e22e2500db692e1d692b9941
https://hal.archives-ouvertes.fr/hal-00643587