Regular language constrained sequence alignment revisited
DOI10.1007/978-3-642-19222-7_39zbMATH Open1326.68373OpenAlexW2134478093WikidataQ58064496 ScholiaQ58064496MaRDI QIDQ3000526FDOQ3000526
Authors: Gregory Kucherov, Tamar Pinhas, Michal Ziv-Ukelson 
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_39
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)
Cites Work
- The Steiner problem in phylogeny is NP-complete
- On the hardness of approximating minimum vertex cover
- The constrained longest common subsequence problem
- Title not available (Why is that?)
- The Rectilinear Steiner Arborescence Problem Is NP-Complete
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- The Steiner problem with edge lengths 1 and 2
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
- Regular expression constrained sequence alignment
- New efficient algorithms for the LCS and constrained LCS problems
- Regular Expressions and NFAs Without ε-Transitions
- Implementation and Application of Automata
- Multicast algorithms for hypercube multiprocessors
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
- An Algorithm for the Computation of Linear Forms
- Efficient algorithms for regular expression constrained sequence alignment
Cited In (10)
- Combinatorial Pattern Matching
- Algorithms for path-constrained sequence alignment
- Regular expression constrained sequence alignment
- 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
- Relational Sequence Alignments and Logos
- Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics
- \textsc{AStarix}: fast and optimal sequence-to-graph alignment
- Practical regular expression constrained sequence alignment
This page was built for publication: Regular language constrained sequence alignment revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000526)
