Fast Evolutionary Chains

Authors:
Maxime Crochemore;Costas S. Iliopoulos;Yoan J. Prinzon
Affiliations:
-;-;-
Venue:
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Year:
2000

Citing 5
Cited 0

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Introducing efficient parallelism into approximate string matching and a new serial algorithm

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Fast parallel and serial approximate string matching

Journal of Algorithms
A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM (JACM)
An Algorithm for Approximate Tandem Repeats

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Musical patterns that recur in approximate, rather than identical, form within the body of a musical work are considered to be of considerable importance in music analysis. Here we consider the "evolutionary chain problem": this is the problem of computing a chain of all "motif" recurrences, each of which is a transformation of ("similar" to) the original motif, but each of which may be progressively further from the original. Here we consider several variants of the evolutionary chain problem and we present efficient algorithms and implementations for solving them.