Regular expression constrained sequence alignment
From MaRDI portal
(Redirected from Publication:925058)
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 699389 (Why is no real title available?)
- A simple algorithm for the constrained sequence problems
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
- Algorithms for the Longest Common Subsequence Problem
- Approximate matching of regular expressions
- The constrained longest common subsequence problem
Cited in
(11)- Efficient Algorithms for Regular Expression Constrained Sequence Alignment
- Combinatorial Pattern Matching
- Efficient algorithms for regular expression constrained sequence alignment
- Computing longest common square subsequences
- A hardness result and new algorithm for the longest common palindromic subsequence problem
- Fast algorithms for computing the constrained LCS of run-length encoded strings
- SA-REPC -- sequence alignment with regular expression path constraint
- Algorithms for path-constrained sequence alignment
- Regular language constrained sequence alignment revisited
- Approximate regular expression pattern matching with concave gap penalties
- Practical regular expression constrained sequence alignment
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)