Practical regular expression constrained sequence alignment
From MaRDI portal
Publication:2310751
DOI10.1016/J.TCS.2020.02.017zbMATH Open1433.68635OpenAlexW3007933202MaRDI QIDQ2310751FDOQ2310751
Guilherme P. Telles, Lise Rommel Romero Navarrete
Publication date: 6 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.02.017
Recommendations
Cites Work
- Title not available (Why is that?)
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- Regular Language Constrained Sequence Alignment Revisited
- Regular expression constrained sequence alignment
- A fast algorithm for the constrained multiple sequence alignment problem
- Constrained sequence alignment: A general model and the hardness results
- Efficient Algorithms for Regular Expression Constrained Sequence Alignment
- Combinatorial Pattern Matching
Cited In (4)
Uses Software
This page was built for publication: Practical regular expression constrained sequence alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2310751)