Algorithms for path-constrained sequence alignment
From MaRDI portal
(Redirected from Publication:396718)
Recommendations
Cites work
- Algorithms for path-constrained sequence alignment
- Algorithms on Strings, Trees and Sequences
- Biological Sequence Analysis
- Comparing the size of NFAs with and without \(\epsilon\)-transitions
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- Regular expression constrained sequence alignment
- Regular language constrained sequence alignment revisited
- SA-REPC -- sequence alignment with regular expression path constraint
- Verifying candidate matches in sparse and wildcard matching
Cited in
(9)- A polyhedral approach to sequence alignment problems
- An efficient algorithm for attribute-based subsequence matching
- Approximate regular expression pattern matching with concave gap penalties
- Constrained sequence alignment: A general model and the hardness results
- scientific article; zbMATH DE number 2086217 (Why is no real title available?)
- SA-REPC -- sequence alignment with regular expression path constraint
- Algorithms for path-constrained sequence alignment
- A path selection approach to global pairwise sequence alignment using integer linear optimization†
- Parametric sequence alignment with constraints
This page was built for publication: Algorithms for path-constrained sequence alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396718)