Efficient algorithms for local alignment search

DOI10.1023/A:1009893719470MaRDI QIDQ5935741zbMATH OpenOpenAlexFDO

Authors Sanguthevar Rajasekaran, Panos M. Pardalos, Sartaj Sahni, Hamidreza M. Nick, G. Shaw

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

zbMATH Keywords

biological sequencesBLASTDNA sequenceslocal alignment researchparallel computingprotein sequences

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Search theory (90B40) Biochemistry, molecular biology (92C40)

Recommendations

• Linear-space algorithms that build local alignments from fragments
• FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
• Efficient algorithms for molecular sequence analysis.
• A time-efficient, linar-space local similarity algorithm
• Fast Algorithms for Local Similarity Queries in Two Sequences

Cited in

(10)

• Mathematical programming strategies for solving the minimum common string partition problem
• Fast Algorithms for Local Similarity Queries in Two Sequences
• DCA based algorithms for multiple sequence alignment (MSA)
• scientific article; zbMATH DE number 2086217 (Why is no real title available?)
• Efficient algorithms for local ranking
• scientific article; zbMATH DE number 1996311 (Why is no real title available?)
• An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score
• DC programming and DCA for challenging problems in bioinformatics and computational biology
• New formulations of the multiple sequence alignment problem
• A space efficient algorithm for finding the best nonoverlapping alignment score

This page was built for publication: Efficient algorithms for local alignment search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935741)