Optimal off-line detection of repetitions in a string, Combinatorial Algorithms on Words, pp.297-315, 1983. ,
DOI : 10.1016/0304-3975(83)90109-3
The Subtree Max Gap Problem with Application to Parallel String Covering, Information and Computation, vol.123, issue.1, pp.127-137, 1996. ,
DOI : 10.1006/inco.1995.1162
A general pitch interval representation: Theory and applications, Journal of New Music Research, vol.8, issue.3, pp.231-251, 1996. ,
DOI : 10.2307/843259
A formal theory for the discovery of local boundaries in a melodic surface, Proceedings of the III Journees d' Informatique Musicale, 1996. ,
The role of similarity in categorisation: Music as a case study, Proceedings of the Third Triennial Conference of the European Society for the Cognitive Sciences of Music (ESCOM), 1997. ,
A Computational Theory for the Discovery of Parallel Melodic Passages, Proceedings of the XI Colloquio di Informatica Musicale, 1995. ,
An optimal algorithm for computing the repetitions in a word, Information Processing Letters, vol.12, issue.5, pp.244-250, 1981. ,
DOI : 10.1016/0020-0190(81)90024-7
URL : https://hal.archives-ouvertes.fr/hal-00619551
The architecture of a software library for string processing, to be presented at Workshop on Algorithm Engineering, 1997. ,
Identifying periodic occurrences of a template with applications to protein structure, Proc. 3rd Combinatorial Pattern Matching, pp.111-120, 1992. ,
DOI : 10.1007/3-540-56024-6_9
An Improved Algorithm For Approximate String Matching, SIAM Journal on Computing, vol.19, issue.6, pp.989-999, 1990. ,
DOI : 10.1137/0219067
Covering a string, Algorithmica, vol.6, issue.3, pp.288-297, 1996. ,
DOI : 10.1007/BF01955677
A linear algorithm for computing the squares of a Fibonacci string, Proceedings CATS'96, \Computing: Australasian Theory Symposium, pp.55-63, 1996. ,
EEcients algorithms for molecular sequences analysis, Proc. Natl. Acad. Sci, pp.841-845, 1988. ,
Introducing eecient parallelism into approximate string matching and a new serial algorithm, Proc. Annual ACM Symposium on Theory of Computing, pp.220-230, 1986. ,
Fast string matching with k differences, Journal of Computer and System Sciences, vol.37, issue.1, pp.63-78, 1988. ,
DOI : 10.1016/0022-0000(88)90045-1
An algorithm for approximate tandem repeats, Proc. Fourth Symposium on Combinatorial Pattern Matching, pp.120-133, 1993. ,
An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms, vol.5, issue.3, pp.422-432, 1984. ,
DOI : 10.1016/0196-6774(84)90021-X
Discovering simple DNA sequences by the algorithmic signiicance method, Comput. Appl. Biosci, vol.9, pp.407-411, 1993. ,
Comparison of musical sequences, Computers and the Humanities, vol.15, issue.3, pp.161-175, 1990. ,
DOI : 10.1007/BF00117340
URL : https://hal.archives-ouvertes.fr/hal-01098807
Computing the covers of a string in linear time, Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pp.511-515, 1994. ,
An algorithm for locating non-overlapping regions of maximum alignment score, Proc. Fourth Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science, 1993. ,
Gray Code Masks for DNA Sequencing by Hybridization, Genomics, vol.23, pp.233-235, 1993. ,
All shortest paths in weighted grid graphs and its application to nding all approximate repeats in strings, Proc. of the Fifth Symposium on Combinatorial Pattern Matching CPM'94, 1994. ,
Reconstructing strings from substrings, J. Computational Biol, vol.2, pp.333-353, 1995. ,