Constrained sequence alignment
From MaRDI portal
Publication:1209899
DOI10.1007/BF02460648zbMath0768.92006OpenAlexW1966250735WikidataQ52397061 ScholiaQ52397061MaRDI QIDQ1209899
Webb Miller, Kun-Mao Chao, Ross C. Hardison
Publication date: 16 May 1993
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02460648
Applications of mathematical programming (90C90) Semi-infinite programming (90C34) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
Cites Work
- Sequence comparison with concave weighting functions
- Approximate matching of regular expressions
- Speeding up dynamic programming with applications to molecular biology
- On the space complexity of some algorithms for sequence comparison
- A time-efficient, linar-space local similarity algorithm
- The Context Dependent Comparison of Biological Sequences
- A linear space algorithm for computing maximal common subsequences
- Sparse dynamic programming I
This page was built for publication: Constrained sequence alignment