Combinatorial Pattern Matching

DOI10.1007/B137128zbMATH Open1131.68469OpenAlexW4301315466MaRDI QIDQ5713554FDOQ5713554

Authors Abdullah N. Arslan 

Publication date 14 December 2005

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

Full work available at URL https://doi.org/10.1007/b137128

zbMATH Keywords

dynamic programmingpattern matchingsequence alignmentfinite automatonregular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Dynamic programming (90C39) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Regular expression constrained sequence alignment
• Efficient algorithms for regular expression constrained sequence alignment
• Efficient Algorithms for Regular Expression Constrained Sequence Alignment
• Practical regular expression constrained sequence alignment
• Regular language constrained sequence alignment revisited

Cited In (10)

• Algorithms for path-constrained sequence alignment
• Regular expression constrained sequence alignment
• SA-REPC -- sequence alignment with regular expression path constraint
• Regular language constrained sequence alignment revisited
• Approximate regular expression pattern matching with concave gap penalties
• Efficient Algorithms for Regular Expression Constrained Sequence Alignment
• Efficient algorithms for regular expression constrained sequence alignment
• Constrained pattern matching
• Practical regular expression constrained sequence alignment
• Constrained sequence alignment: A general model and the hardness results

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 Q5713554)