2009
DOI: 10.1142/s0219720009003972
|View full text |Cite
|
Sign up to set email alerts
|

Analyzing Microarray Data With Transitive Directed Acyclic Graphs

Abstract: Post hoc assignment of patterns determined by all pairwise comparisons in microarray experiments with multiple treatments has been proven to be useful in assessing treatment effects. We propose the usage of transitive directed acyclic graphs (tDAG) as the representation of these patterns and show that such representation can be useful in clustering treatment effects, annotating existing clustering methods, and analyzing sample sizes. Advantages of this approach include: (1) unique and descriptive meaning of ea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(20 citation statements)
references
References 27 publications
0
20
0
Order By: Relevance
“…Zhu et al (2005) use a hybrid distance matrix having both direct and shortest-path distances for clustering. Phan et al (2009) also use transitive directed acyclic graphs for representation of expression patterns. Once the data are clustered based on a distance measure, validation of the clustering algorithm's performance is essential.…”
Section: Problem Deifinition and Representations Of Gene Expressionmentioning
confidence: 99%
“…Zhu et al (2005) use a hybrid distance matrix having both direct and shortest-path distances for clustering. Phan et al (2009) also use transitive directed acyclic graphs for representation of expression patterns. Once the data are clustered based on a distance measure, validation of the clustering algorithm's performance is essential.…”
Section: Problem Deifinition and Representations Of Gene Expressionmentioning
confidence: 99%
“…NP-complete is a class of problems that are in NP and reducible to an NP-complete problem in polynomial time. Some examples of graph theory-based clustering approaches are: [30] and [24].…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…Researchers employed dozens to hundreds of treatments in their studies [1,6]. To deal with such many treatments, a number of post hoc approaches have been proposed [8,5,7]. While [8,5] used ternary digits to represent patterns of gene response to all treatment pairs, [7] used directed graphs to represent these patterns.…”
Section: Introductionmentioning
confidence: 99%
“…To deal with such many treatments, a number of post hoc approaches have been proposed [8,5,7]. While [8,5] used ternary digits to represent patterns of gene response to all treatment pairs, [7] used directed graphs to represent these patterns. In ternary digit representation, each pattern has a sequence of digits in which each digit represents how a gene respond to pairs of treatments.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation