2004
DOI: 10.1093/bioinformatics/bti095
|View full text |Cite
|
Sign up to set email alerts
|

Clustering of gene expression data using a local shape-based similarity measure

Abstract: Here, we propose a new method (CLARITY; Clustering with Local shApe-based similaRITY) for the analysis of microarray time course experiments that uses a local shape-based similarity measure based on Spearman rank correlation. This measure does not require a normalization of the expression data and is comparably robust towards noise. It is also able to detect similar and even time-shifted sub-profiles. To this end, we implemented an approach motivated by the BLAST algorithm for sequence alignment. We used CLARI… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
70
0
2

Year Published

2005
2005
2015
2015

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 101 publications
(73 citation statements)
references
References 25 publications
0
70
0
2
Order By: Relevance
“…Instead, robust, coherent, and dominating qualitative features and similarities could be a more informative proxy for the information content of the expression experiment. The raw data are transformed to sequences of events or symbols, and these are further analyzed for consistencies, either local or global (56). Looking for general shapes as opposed to quantifying distances allows for, among other things, a more flexible representation, which uncovers more intricate relations among expression profiles, such as time shifts and inversion in expression profiles (57).…”
Section: Feature-based Clustering Methodsmentioning
confidence: 99%
“…Instead, robust, coherent, and dominating qualitative features and similarities could be a more informative proxy for the information content of the expression experiment. The raw data are transformed to sequences of events or symbols, and these are further analyzed for consistencies, either local or global (56). Looking for general shapes as opposed to quantifying distances allows for, among other things, a more flexible representation, which uncovers more intricate relations among expression profiles, such as time shifts and inversion in expression profiles (57).…”
Section: Feature-based Clustering Methodsmentioning
confidence: 99%
“…For example, it is relevant for the prediction of every sort of ordering of a fixed set of elements, such as the preferential order of a fixed set of products (e.g., different types of holiday apartments) based on demographic properties of a person, or the ordering of a set of genes according to their expression level (as measured by microarray analysis) based on features of their phylogenetic profile [1]. Another application scenario is meta-learning, where the task is to rank learning algorithms according to their suitability for a new dataset, based on the characteristics of this dataset [7].…”
Section: Label Rankingmentioning
confidence: 99%
“…Rank correlation has been employed on an eclectic variety of domains, including bioinformatics (Balasubramaniyan et al, 2005), information retrieval (Yilmaz et al, 2008), recommender systems (Breese et al, 1998), and determining molecular structure by lanthanide shift reagents (Li and Lee, 1980). Finding coherent subgroups of the dataset at hand displaying exceptional interaction between two targets, as measured through rank correlation, should be interesting to practitioners in these fields.…”
Section: Introductionmentioning
confidence: 99%