On all-substrings alignment problems

DOI10.1007/3-540-45071-8_10MaRDI QIDQ3082915zbMATH OpenOpenAlexFDO

Authors Wei Fu, Wing-Kai Hon, Wing-Kin Sung

Publication date 18 March 2011

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

Full work available at URL https://doi.org/10.1007/3-540-45071-8_10

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 2119727
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• On the common substring alignment problem
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• Consequences of Faster Alignment of Sequences

Cited in

(9)

• scientific article; zbMATH DE number 2119727 (Why is no real title available?)
• On locally optimal alignments in genetic sequences
• Combinatorial Pattern Matching
• A graph approach to the threshold all-against-all substring matching problem
• On computing all suboptimal alignments
• scientific article; zbMATH DE number 1445380 (Why is no real title available?)
• Bounded-length Smith-Waterman alignment
• A linear-space algorithm for the substring constrained alignment problem
• On the common substring alignment problem

This page was built for publication: On all-substrings alignment problems

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