Combinatorial Pattern Matching

DOI10.1007/B98377zbMATH Open1103.68565MaRDI QIDQ5315342FDOQ5315342

Authors: Nadav Efraty, Gad M. Landau 

Publication date: 7 September 2005

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

Recommendations

• Sparse normalized local alignment
• Sparse LCS Common Substring Alignment
• Sparse LCS common substring alignment
• On all-substrings alignment problems
• Bounded-length Smith-Waterman alignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Cited In (3)

• Bounded-length Smith-Waterman alignment
• Sparse normalized local alignment
• On locally optimal alignments in genetic sequences

This page was built for publication: Combinatorial Pattern Matching

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