AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

A fast parallel algorithm for finding the longest common sequence of multiple biosequences.

BMC Bioinformatics, no. S-4 (2006): S4-S4

Cited: 88|Views31

WOS SCOPUS EI

Full Text

View via Publisher

Other Links

pubmed.ncbi.nlm.nih.gov dblp.uni-trier.de link.springer.com academic.microsoft.com

Bibtex

Keywords

bioinformaticsparallel algorithmdna sequencemicroarraysalgorithmsMore(2+)

Abstract

Searching for the longest common sequence (LCS) of multiple biosequences is one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel algorithm named FAST_LCS to speedup the computation for finding LCS.A fast parallel algorithm for LCS is presented. The algorithm first constructs a novel successor table to ...More

Code:

Data:

Full Text

PPT (Upload PPT)

Similar

Reference

Cited

Author

Yixin Chen (陈一昕)

[0]

Andrew Wan

[0]

Wei Liu (刘伟)

[0]

Your rating :

No Ratings