Results

**1 - 2**of**2**### Thin Tree Position

, 2014

"... We introduce a method for creating a special type of tree, a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing op-erations to the ..."

Abstract
- Add to MetaCart

(Show Context)
We introduce a method for creating a special type of tree, a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing op-erations to the tree position we arrive at a thin tree position, and we show that partitions arising from thin tree positions have especially nice properties. The algorithm is based the topological notion of thin position for knots and 3â€“manifolds and builds on the previously defined idea of a Topological Intrinsic Lexicographic Order (TILO). 1

### An application of topological graph clustering to protein function prediction

, 2014

"... We use a semisupervised learning algorithm based on a topological data analysis approach to assign functional categories to yeast proteins using similarity graphs. This new approach to analyzing biological networks yields results that are as good as or better than state of the art existing approache ..."

Abstract
- Add to MetaCart

(Show Context)
We use a semisupervised learning algorithm based on a topological data analysis approach to assign functional categories to yeast proteins using similarity graphs. This new approach to analyzing biological networks yields results that are as good as or better than state of the art existing approaches. 1