Practical regular expression constrained sequence alignment
From MaRDI portal
Publication:2310751
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- A fast algorithm for the constrained multiple sequence alignment problem
- Combinatorial Pattern Matching
- Constrained sequence alignment: A general model and the hardness results
- Efficient Algorithms for Regular Expression Constrained Sequence Alignment
- Regular expression constrained sequence alignment
- Regular language constrained sequence alignment revisited
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
Cited in
(9)- Algorithms for path-constrained sequence alignment
- Combinatorial Pattern Matching
- Regular expression constrained sequence alignment
- SA-REPC -- sequence alignment with regular expression path constraint
- Regular language constrained sequence alignment revisited
- Approximate regular expression pattern matching with concave gap penalties
- Efficient Algorithms for Regular Expression Constrained Sequence Alignment
- Efficient algorithms for regular expression constrained sequence alignment
- Counting regular expressions in degenerated sequences through lazy Markov chain embedding
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)