A space efficient algorithm for finding the best nonoverlapping alignment score

DOI10.1016/0304-3975(95)92848-RMaRDI QIDQ673113zbMATH OpenFDO

Authors G. 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)

Recommendations

• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• A space-efficient algorithm for sequence alignment with inversions and reversals
• Implementation and Application of Automata
• General space-efficient sampling algorithm for suboptimal alignment
• A sparse dynamic programming algorithm for alignment with non-overlapping inversions
• scientific article; zbMATH DE number 2243390
• Efficient algorithms for local alignment search
• A bit-parallel, general integer-scoring sequence alignment algorithm

Cites work

• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• An \(O(ND)\) difference algorithm and its variations
• Efficient Parallel Algorithms for String Editing and Related Problems
• The String-to-String Correction Problem

Cited in

(9)

• A Space Efficient Algorithm for Sequence Alignment with Inversions
• Identifying periodic occurrences of a template with applications to protein structure
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• General space-efficient sampling algorithm for suboptimal alignment
• Sequence Alignment Algorithms for Run-Length-Encoded Strings
• Sparse LCS common substring alignment
• Efficient all path score computations on grid graphs
• Approximate periodicity
• On almost Monge all scores matrices

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

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