Efficient algorithms for local alignment search
From MaRDI portal
Publication:5935741
DOI10.1023/A:1009893719470zbMath1028.92009OpenAlexW2084175832MaRDI QIDQ5935741
No author found.
Publication date: 7 January 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009893719470
Search theory (90B40) Biochemistry, molecular biology (92C40) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)
Related Items
DCA based algorithms for multiple sequence alignment (MSA) ⋮ Mathematical programming strategies for solving the minimum common string partition problem ⋮ New formulations of the multiple sequence alignment problem ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology
This page was built for publication: Efficient algorithms for local alignment search
