Back to Results
First PageMeta Content
Sequence alignment / Multiple sequence alignment / BLAST / Smith–Waterman algorithm / Needleman–Wunsch algorithm / T-Coffee / Phylo / Fast Fourier transform / FASTA / Computational phylogenetics / Bioinformatics / Science


33 A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment* Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dave, and Chun-Hsi Huang School of Computer Science and Engineering, University o
Add to Reading List

Document Date: 2004-10-13 08:46:16


Open Document

File Size: 244,53 KB

Share Result on Facebook

/

Facility

University of Connecticut / /

IndustryTerm

still polynomial time algorithms / complicated algorithms / sequence alignment algorithms / Dynamic programming algorithm / data-mining / above algorithm / recent algorithm / certain scoring systems / alignment algorithm / /

Organization

Chun-Hsi Huang School of Computer Science and Engineering / National Science Foundation / University of Connecticut / /

Person

Vishal Thapar / /

Technology

length N. Our algorithm / clustering algorithm / T-COFFEE algorithms / Needleman-Wunsch algorithm / above algorithm / bioinformatics / Dynamic programming algorithm / Needleman Wunsch algorithm / sequence alignment algorithms / randomized algorithm / Genetic algorithms / 3-D / relatively recent algorithm / still polynomial time algorithms / 3 Randomized Algorithm / MSA algorithms / alignment algorithm / Human Genome / competing algorithms / /

SocialTag