APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
From MaRDI portal
Publication:3021984
DOI10.1142/S0129054102001436zbMath1066.92020MaRDI QIDQ3021984
Abdullah N. Arslan, Ömer Eğecioğlu
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)
Cites Work
- On a cyclic string-to-string correction problem
- Locally optimal subalignments using nonlinear similarity functions
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- A time-efficient, linar-space local similarity algorithm
- Incremental String Comparison
- The String-to-String Correction Problem
This page was built for publication: APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS