An efficient algorithm for sequence comparison with block reversals
From MaRDI portal
Publication:596144
DOI10.1016/j.tcs.2003.05.005zbMath1068.68115OpenAlexW2019441027MaRDI QIDQ596144
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.05.005
Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Permutations, words, matrices (05A05)
Related Items
An algorithm with linear expected running time for string editing with substitutions and substring reversals ⋮ A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block edit models for approximate string matching
- Approximate nearest neighbors and sequence comparison with block operations
- Fast Algorithms for Finding Nearest Common Ancestors
- The theory and computation of evolutionary distances: Pattern recognition
- A universal algorithm for sequential data compression
This page was built for publication: An efficient algorithm for sequence comparison with block reversals