NDLI: Phylogeny By Top Down Clustering Using a Given Multiple Alignment

Content Provider	IEEE Xplore Digital Library
Author	Arslan, A.N. Bizargity, P.
Copyright Year	2007
Description	Author affiliation: Univ. of Vermont, Burlington (Arslan, A.N.)
Abstract	We present a new phylogenetic tree construction algorithm. Our algorithm takes as input an alignment of multiple sequences. We assume that the sequences in the given alignment are closely related by evolution, and that the given alignment is biologically correct. Our approach has some similarities with the well-known clustering procedure UPGMA in that we define the distance between two clusters similarly, and we can build the tree using vertical distances to denote evolutionary distances. However, our approach is fundamentally different in choosing the clusters since it works from top to bottom. We select a pair of clusters with the maximum distance first, and then recursively create clusters for each. Since trying all possible clusterings is impractical, as an approximation to this approach, we examine all conserved segments in the given multiple sequence alignment, and for each we try two clusters: one in which the conserved region is identical in each sequence in this cluster, and the cluster composed of the rest of the sequences. Our main hypothesis is that the top-down approach will perform better compared to a bottom-up UPGMA method, in separating large cluster pairs from each other, and this will not prevent very close sequences from appearing in near leaves. We tested our algorithm using a multiple sequence alignment given in a recent paper that builds a phylogenetic tree of amino acid sequences from the Runt domain of RUNX genes from a set of species using existing techniques. Our tree has a few differences compared to this tree. We believe that our approach provides alternative valuable information for phylogeny.
Starting Page	809
Ending Page	814
File Size	2738453
Page Count	6
File Format	PDF
ISBN	9781424415090
DOI	10.1109/BIBE.2007.4375653
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-10-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Phylogeny Clustering algorithms Equations Computer science Educational institutions Matrices Character generation Evolution (biology) Testing Amino acids RUNX genes phylogenetic tree construction clustering UPGMA multiple sequence alignment substitution matrix PAM Runt domain
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Parallel UPGMA Algorithm on Graphics Processing Units Using CUDA

Multiple sequence alignment using minimum spanning tree

Organism specific amino acid substitution matrices.

Evdtree : structure-dependent substitution matrices based on decision tree classification of 3d environments (2003).

Multiple sequence alignment based on structural properties

Optimal scoring matrices for estimating distances between aligned sequences (1999).

Amino Acid Substitution Matrices Based on 4-Body Delaunay Contact Profiles

Substitution Matrices of Residue Triplets Derived from Protein Blocks

A Refined MSAPSO Algorithm for Improving Alignment Score

Phylogeny By Top Down Clustering Using a Given Multiple Alignment

Similar Documents

Parallel UPGMA Algorithm on Graphics Processing Units Using CUDA

Multiple sequence alignment using minimum spanning tree

Organism specific amino acid substitution matrices.

Evdtree : structure-dependent substitution matrices based on decision tree classification of 3d environments (2003).

Multiple sequence alignment based on structural properties

Optimal scoring matrices for estimating distances between aligned sequences (1999).

Amino Acid Substitution Matrices Based on 4-Body Delaunay Contact Profiles

Substitution Matrices of Residue Triplets Derived from Protein Blocks

A Refined MSAPSO Algorithm for Improving Alignment Score

Phylogeny By Top Down Clustering Using a Given Multiple Alignment