A space efficient algorithm for finding the best nonoverlapping alignment score

DOI10.1016/0304-3975(95)92848-RzbMath0873.68041MaRDI QIDQ673113

Gary Benson

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

DNA

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (5)

Sequence Alignment Algorithms for Run-Length-Encoded Strings ⋮ Efficient all path score computations on grid graphs ⋮ On almost Monge all scores matrices ⋮ Sparse LCS common substring alignment ⋮ Approximate periodicity

Cites Work

• Unnamed Item
• An \(O(ND)\) difference algorithm and its variations
• Efficient Parallel Algorithms for String Editing and Related Problems
• The String-to-String Correction Problem

This page was built for publication: A space efficient algorithm for finding the best nonoverlapping alignment score