A fast parallel algorithm for finding the longest common sequence of multiple biosequences
Open Access
- 12 December 2006
- journal article
- research article
- Published by Springer Science and Business Media LLC in BMC Bioinformatics
- Vol. 7 (4), S4
- https://doi.org/10.1186/1471-2105-7-S4-S4
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelismInformation Processing Letters, 2004
- Systolic-based parallel architecture for the longest common subsequences problemIntegration, 1998
- Linear array with a reconfigurable pipelined bus system — Concepts and applicationsInformation Sciences, 1998
- CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choiceNucleic Acids Research, 1994
- Parallel algorithms for the longest common subsequence problemIEEE Transactions on Parallel and Distributed Systems, 1994
- Basic local alignment search toolJournal of Molecular Biology, 1990
- An improved algorithm for matching biological sequencesJournal of Molecular Biology, 1982
- Optimal Code Generation for Expression TreesJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970