Algorithms for path-constrained sequence alignment
From MaRDI portal
Publication:396718
DOI10.1016/J.JDA.2013.09.003zbMath1334.68321OpenAlexW2071685176WikidataQ58064462 ScholiaQ58064462MaRDI QIDQ396718
Tamar Pinhas, Gregory Kucherov, Nimrod Milo, Michal Ziv-Ukelson
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.09.003
Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)
Related Items (2)
An efficient algorithm for attribute-based subsequence matching ⋮ Algorithms for path-constrained sequence alignment
Cites Work
- Unnamed Item
- Algorithms for path-constrained sequence alignment
- Regular expression constrained sequence alignment
- Comparing the size of NFAs with and without \(\epsilon\)-transitions
- Regular Language Constrained Sequence Alignment Revisited
- SA-REPC – Sequence Alignment with Regular Expression Path Constraint
- Verifying candidate matches in sparse and wildcard matching
- Fast Pattern Matching in Strings
- Biological Sequence Analysis
- Algorithms on Strings, Trees and Sequences
This page was built for publication: Algorithms for path-constrained sequence alignment