A linear-space algorithm for the substring constrained alignment problem

DOI10.1007/978-3-319-46049-9_2MaRDI QIDQ1796823zbMATH OpenOpenAlexFDO

Authors Yoshifumi Sakai

Publication date 17 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-46049-9_2

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• On all-substrings alignment problems
• Publication:4952703
• Implementation and Application of Automata
• Sublinear space algorithms for the longest common substring problem
• On the common substring alignment problem
• An almost-linear time and linear space algorithm for the longest common subsequence problem
• Efficient algorithms for the longest common subsequence problem with sequential substring constraints
• On the complexity of constrained sequences alignment problems
• A new practical linear space algorithm for the longest common subsequence problem
• A versatile divide and conquer technique for optimal string alignment

Cited in

(5)

• Sparse LCS Common Substring Alignment
• A versatile divide and conquer technique for optimal string alignment
• Sparse LCS common substring alignment
• General space-efficient sampling algorithm for suboptimal alignment
• On the common substring alignment problem

This page was built for publication: A linear-space algorithm for the substring constrained alignment problem

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