Regular expression constrained sequence alignment
From MaRDI portal
Publication:925058
DOI10.1016/J.JDA.2007.01.003zbMATH Open1181.68164OpenAlexW2042428691MaRDI QIDQ925058FDOQ925058
Authors: 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
Recommendations
Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Dynamic programming (90C39) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- The constrained longest common subsequence problem
- A simple algorithm for the constrained sequence problems
- Title not available (Why is that?)
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
- Algorithms for the Longest Common Subsequence Problem
- Approximate matching of regular expressions
Cited In (11)
- Combinatorial Pattern Matching
- Algorithms for path-constrained sequence alignment
- Fast algorithms for computing the constrained LCS of run-length encoded strings
- SA-REPC -- sequence alignment with regular expression path constraint
- Regular language constrained sequence alignment revisited
- Computing longest common square subsequences
- Approximate regular expression pattern matching with concave gap penalties
- Efficient Algorithms for Regular Expression Constrained Sequence Alignment
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- Efficient algorithms for regular expression constrained sequence alignment
- Practical regular expression constrained sequence alignment
Uses Software
This page was built for publication: Regular expression constrained sequence alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925058)
