Ang`ele M. Hamel

, Bro^na Brejov'a 1 (2008)

Therese Biedl, Erik D. Demaine, Ang`ele M. Hamel

1, Tom'a^s Vina^r 1 1

Finding hidden independent sets in interval graphs. Theoretical Computer Science (2004)

Therese Biedl, Erik D. Demaine, Ang`ele M. Hamel

1 Introduction An interval graph is an intersection graph of intervals on the real line, i.e. vertices are represented by intervals and there is an edge between two vertices if and only if their...

Finding hidden independent sets in interval graphs. Theoretical Computer Science (2004)

Therese Biedl, Erik D. Demaine, Ang`ele M. Hamel

1 Introduction An interval graph is an intersection graph of intervals on the real line, i.e. vertices are represented by intervals and there is an edge between two vertices if and only if their...

K-ary clustering with optimal leaf ordering for gene expression data (2003)

Ziv Bar-joseph, Erik D. Demaine, David K. Gifford, Ang`ele M. Hamel, Tommi S. Jaakkola, Nathan Srebro

K-ary clustering with optimal leaf ordering for gene expression data (2003)

Ziv Bar-joseph, Erik D. Demaine, David K. Gifford, Ang`ele M. Hamel, Tommi S. Jaakkola, Nathan Srebro

Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data (2001)

Therese Biedl, Erik D. Demaine, Ang`ele M. Hamel