Time and space efficient algorithms for constrained sequence alignment
From MaRDI portal
Recommendations
- Constrained sequence alignment
- A fast algorithm for the constrained multiple sequence alignment problem
- Constrained sequence alignment: A general model and the hardness results
- A simple algorithm for the constrained sequence problems
- An algorithm and applications to sequence alignment with weighted constraints
Cited in
(17)- Constrained sequence alignment
- A linear-space algorithm for the substring constrained alignment problem
- Fast algorithms for a space-time concordance measure
- Constrained sequence alignment: A general model and the hardness results
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches
- Dynamic programming based approximation algorithms for sequence alignment with constraints
- A versatile divide and conquer technique for optimal string alignment
- Regular language constrained sequence alignment revisited
- A Space Efficient Algorithm for Sequence Alignment with Inversions
- On the complexity of constrained sequences alignment problems
- Constrained pairwise and center-star sequences alignment problems
- Multiple genome alignment: chaining algorithms revisited
- General space-efficient sampling algorithm for suboptimal alignment
- An algorithm and applications to sequence alignment with weighted constraints
- A fast algorithm for the constrained multiple sequence alignment problem
- Computational and Information Science
- A space efficient algorithm for finding the best nonoverlapping alignment score
This page was built for publication: Time and space efficient algorithms for constrained sequence alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463984)
