An algorithm with linear expected running time for string editing with substitutions and substring reversals
References (14)
- et al.
Efficient algorithms for approximate string matching with swaps
Journal of Complexity
(1999) - et al.
Block edit models for approximate string matching
Theoretical Computer Science
(1997) - et al.
An improved algorithm for sequence comparison with block reversals
Theoretical Computer Science
(2004) The theory and computation of evolutionary distances: Pattern recognition
Journal of Algorithms
(1980)- A.N. Arslan, An algorithm for string edit distance allowing substring reversals, in: Proc. the 6th IEEE Symposium on...
- et al.
Evolution of Amino acid frequencies in proteins over deep time: Inferred order of introduction of amino acids into the genetic code
Mol. Biol. Evol.
(2002) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
(1997)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2007 Elsevier B.V. All rights reserved.