On locally optimal alignments in genetic sequences

DOI10.1007/3-540-55210-3_202MaRDI QIDQ5096800zbMATH OpenOpenAlexFDO

Authors Norbert Blum

Publication date 18 August 2022

Published in STACS 92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55210-3_202

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 2086217
• On all-substrings alignment problems
• Locally optimal subalignments using nonlinear similarity functions
• Sparse normalized local alignment
• Combinatorial Pattern Matching

Cites work

• A faster algorithm computing string edit distances
• Algorithms for approximate string matching
• An \(O(ND)\) difference algorithm and its variations
• General methods of sequence comparison
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(4)

• Hardness of approximation for non-overlapping local alignments.
• scientific article; zbMATH DE number 2086217 (Why is no real title available?)
• Algorithms and Computation
• Local Alignment of RNA Sequences with Arbitrary Scoring Schemes

This page was built for publication: On locally optimal alignments in genetic sequences

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