An efficient algorithm for sequence comparison with block reversals

DOI10.1016/J.TCS.2003.05.005MaRDI QIDQ596144zbMATH OpenOpenAlexFDO

Authors Sumit K. Garg

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

zbMATH Keywords

Block edit distanceSequence comparisonString periodicity

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2086238
• A space-efficient algorithm for sequence alignment with inversions and reversals
• A block recursive sequence alignment algorithm
• An O(NP) sequence comparison algorithm
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• Theoretical Computer Science
• A new combinatorial approach to sequence comparison
• A simple, fast, filter-based algorithm for circular sequence comparison
• scientific article; zbMATH DE number 826057
• scientific article; zbMATH DE number 975424

Cites work

• A universal algorithm for sequential data compression
• Approximate nearest neighbors and sequence comparison with block operations
• Block edit models for approximate string matching
• Fast Algorithms for Finding Nearest Common Ancestors
• scientific article; zbMATH DE number 2086238 (Why is no real title available?)
• scientific article; zbMATH DE number 3551946 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(9)

• Block reversal on finite words
• scientific article; zbMATH DE number 2086238 (Why is no real title available?)
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• Approximate nearest neighbors and sequence comparison with block operations
• scientific article; zbMATH DE number 2087059 (Why is no real title available?)
• A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• An algorithm with linear expected running time for string editing with substitutions and substring reversals
• Efficient algorithms for the block edit problems

This page was built for publication: An efficient algorithm for sequence comparison with block reversals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596144)