default search action
Pascal Ferraro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j10]Julien Allali, Cédric Saule, Cédric Chauve
, Yves D'Aubenton-Carafa, Alain Denise, Christine Drevet, Pascal Ferraro, Daniel Gautheret
BRASERO: A Resource for Benchmarking RNA Secondary Structure Comparison Algorithms. Adv. Bioinformatics 2012: 893048:1-893048:5 (2012) - [j9]Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard:
Efficient chaining of seeds in ordered trees. J. Discrete Algorithms 14: 107-118 (2012) - [c17]Benjamin Martin, Daniel G. Brown, Pierre Hanna, Pascal Ferraro:
BLAST for Audio Sequences Alignment: A Fast Scalable Cover Identification Tool. ISMIR 2012: 529-534 - 2011
- [c16]Benjamin Martin, Pierre Hanna, Ta Vinh Thong, Myriam Desainte-Catherine, Pascal Ferraro:
Exemplar-based Assignment of Large Missing Audio Parts using String Matching on Tonal Features. ISMIR 2011: 507-512 - [c15]Benjamin Martin, Pierre Hanna
Indexing musical pieces using their major repetition. JCDL 2011: 153-156 - [c14]Benjamin Martin, Pierre Hanna
Towards an indexing method to speed-up music retrieval. SIGIR 2011: 1167-1168 - 2010
- [j8]Christophe Godin
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 688-703 (2010) - [c13]Julien Allali, Pascal Ferraro, Costas S. Iliopoulos, Spiros Michalakopoulos:
Combinatorial Detection of Arrhythmia. BIOSIGNALS 2010: 180-187 - [c12]Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard:
Efficient Chaining of Seeds in Ordered Trees. IWOCA 2010: 260-273
2000 – 2009
- 2009
- [j7]Julien Allali, Pascal Ferraro, Pierre Hanna
Toward a General Framework for Polyphonic Comparison. Fundam. Informaticae 97(3): 331-346 (2009) - [j6]Aïda Ouangraoua, Pascal Ferraro:
A new constrained edit distance between quotiented ordered trees. J. Discrete Algorithms 7(1): 78-89 (2009) - [j5]Aïda Ouangraoua, Pascal Ferraro:
A constrained edit distance algorithm between semi-ordered trees. Theor. Comput. Sci. 410(8-10): 837-846 (2009) - [c11]Julien Allali, Pascal Ferraro, Pierre Hanna
Polyphonic Alignment Algorithms for Symbolic Music Retrieval. CMMR/ICAD 2009: 466-482 - [c10]Matthias Robine, Pierre Hanna, Thomas Rocher, Pascal Ferraro:
Structured Representation of Harmony for Music Retrieval. ICMC 2009 - [c9]Pascal Ferraro, Pierre Hanna, Laurent Imbert, Thomas Izard:
Accelerating Query-by-Humming on GPU. ISMIR 2009: 279-284 - [c8]Julien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed:
Validation and Decomposition of Partially Occluded Images with Holes. Stringology 2009: 129-136 - 2008
- [j4]Pierre Hanna, Pascal Ferraro, Matthias Robine, Julien Allali:
Recherche de documents musicaux par similarité mélodique. Document Numérique 11(3-4): 107-125 (2008) - [c7]Pierre Hanna, Matthias Robine, Pascal Ferraro:
Visualisation of Musical Structure by Applying Improved Editing Algorithms. ICMC 2008 - 2007
- [j3]Aïda Ouangraoua, Pascal Ferraro, Laurent Tichit, Serge Dulucq:
Local similarity between quotiented ordered trees. J. Discrete Algorithms 5(1): 23-35 (2007) - [c6]Pierre Hanna
Polyphonic Music Retrieval by Local Edition of Quotiented Sequences. CBMI 2007: 61-68 - [c5]Matthias Robine, Pierre Hanna
Music similarity: improvements of edit-based algorithms by considering music theory. Multimedia Information Retrieval 2007: 135-142 - [c4]Pierre Hanna, Pascal Ferraro:
Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences. RIAO 2007: 64-69 - [c3]Matthias Robine, Pierre Hanna, Pascal Ferraro, Julien Allali:
Adaption of String Matching Algorithms for Identification of Near-Duplicate Music Documents. PAN 2007 - [c2]Julien Allali, Pascal Ferraro, Pierre Hanna
Local Transpositions in Alignment of Polyphonic Musical Sequences. SPIRE 2007: 26-38 - 2003
- [j2]Pascal Ferraro, Christophe Godin
An Edit Distance between Quotiented Trees. Algorithmica 36(1): 1-39 (2003) - [j1]Pascal Ferraro, Christophe Godin
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems. J. Algorithms 48(2): 385-406 (2003) - 2002
- [c1]Pascal Ferraro, Christophe Godin, Przemyslaw Prusinkiewicz:
L-systems and MTGs: Integrating Simulation and Formal Analysis of Architectural Plant Models. ESM 2002: 418-422
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: