Regular expression constrained sequence alignment

DOI10.1016/j.jda.2007.01.003zbMath1181.68164OpenAlexW2042428691MaRDI QIDQ925058

Abdullah N. Arslan

Publication date: 29 May 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2007.01.003

zbMATH Keywords

dynamic programmingfinite automatonpattern matchingsequence alignmentregular expression

Mathematics Subject Classification ID

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

Related Items (6)

A hardness result and new algorithm for the longest common palindromic subsequence problem ⋮ Algorithms for path-constrained sequence alignment ⋮ Fast algorithms for computing the constrained LCS of run-length encoded strings ⋮ Regular Language Constrained Sequence Alignment Revisited ⋮ Practical regular expression constrained sequence alignment ⋮ Unnamed Item

Uses Software

• MuSiC

Cites Work

• Unnamed Item
• Unnamed Item
• The constrained longest common subsequence problem
• Approximate matching of regular expressions
• A simple algorithm for the constrained sequence problems
• Algorithms for the Longest Common Subsequence Problem
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

This page was built for publication: Regular expression constrained sequence alignment