An improved algorithm for sequence comparison with block reversals

DOI10.1007/3-540-45995-2_30MaRDI QIDQ3044336zbMATH OpenFDO

Authors S. Muthukrishnan, Süleyman Cenk Sahinalp

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860319.htm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• An efficient algorithm for sequence comparison with block reversals
• A block recursive sequence alignment algorithm
• Theoretical Computer Science
• A new combinatorial approach to sequence comparison
• A space-efficient algorithm for sequence alignment with inversions and reversals
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• An O(NP) sequence comparison algorithm
• An improved block-interchange algorithm

Cited in

(5)

• A space-efficient algorithm for sequence alignment with inversions and reversals
• Distance measures for biological sequences: some recent approaches
• Simple and practical sequence nearest neighbors with block operations
• An efficient algorithm for sequence comparison with block reversals
• An algorithm with linear expected running time for string editing with substitutions and substring reversals

This page was built for publication: An improved 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 Q3044336)