A space efficient algorithm for finding the best nonoverlapping alignment score

DOI10.1016/0304-3975(95)92848-RzbMATH Open0873.68041MaRDI QIDQ673113FDOQ673113

Authors: G. Benson 

Publication date: 28 February 1997

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

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

zbMATH Keywords

DNA

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• The String-to-String Correction Problem
• Efficient Parallel Algorithms for String Editing and Related Problems
• An \(O(ND)\) difference algorithm and its variations

Cited In (9)

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

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)