NDLI: RBT-Km: K-Means clustering for Multiple Sequence Alignment

Content Provider	IEEE Xplore Digital Library
Author	Taheri, J. Zomaya, A.Y.
Copyright Year	2010
Description	Author affiliation: School of Information Technologies, J12, The University of Sydney, NSW 2006, Australia (Taheri, J.; Zomaya, A.Y.)
Abstract	This paper presents a novel approach for solving the Multiple Sequence Alignment (MSA) problem. K-Means clustering is combined with the Rubber Band Technique (RBT) to introduce an iterative optimization algorithm, namely RBT-Km, to find the optimal alignment for a set of input protein sequences. In this technique, the MSA problem is modeled as a Rubber Band, while the solution space is modeled as plate with several poles corresponding locations in the input sequences that are most likely to be correlated and/or biologically related. K-Means clustering is then used to discriminate biologically related locations from those that may appear by chance. RBT-Km is tested with one of the well-known benchmarks in this field (BALiBASE 2.0). The results demonstrate the superiority of the proposed technique even in the case of formidable sequences.
Starting Page	1
Ending Page	8
File Size	863406
Page Count	8
File Format	PDF
ISBN	9781424477166
e-ISBN	9781424477173
DOI	10.1109/AICCSA.2010.5586934
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-05-16
Publisher Place	Tunisia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Benchmark testing Rubber Hidden Markov models Clustering algorithms Biology Optimization K-Means Clustering Multiple Sequence Alignment
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 Libarray 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

Rbt-km: k-means clustering for multiple sequence alignment (2008).

Crowd analysis with target tracking, K-means clustering and hidden Markov models

RBT-I: A novel approach for solving the Multiple Sequence Alignment problem

A New Markov Model for Clustering Categorical Sequences

Optimization of the backpropagation hidden layer by hybrid K-means-Greedy Algorithm for time series prediction

Background removal by modified fuzzy C-means clustering algorithm

RBT-L: A Location Based Approach for Solving the Multiple Sequence Alignment Problem,” The

Partitioned optimization algorithms for multiple sequence alignment

A modified algorithm for clustering based on particle swarm optimization and K-means

RBT-Km: K-Means clustering for Multiple Sequence Alignment

Similar Documents

Rbt-km: k-means clustering for multiple sequence alignment (2008).

Crowd analysis with target tracking, K-means clustering and hidden Markov models

RBT-I: A novel approach for solving the Multiple Sequence Alignment problem

A New Markov Model for Clustering Categorical Sequences

Optimization of the backpropagation hidden layer by hybrid K-means-Greedy Algorithm for time series prediction

Background removal by modified fuzzy C-means clustering algorithm

RBT-L: A Location Based Approach for Solving the Multiple Sequence Alignment Problem,” The

Partitioned optimization algorithms for multiple sequence alignment

A modified algorithm for clustering based on particle swarm optimization and K-means

RBT-Km: K-Means clustering for Multiple Sequence Alignment