Sciweavers

40 search results - page 6 / 8
» Faster subtree isomorphism
Sort
View
DAM
2007
70views more  DAM 2007»
13 years 7 months ago
Tree-edges deletion problems with bounded diameter obstruction sets
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
Dekel Tsur
IANDC
2011
148views more  IANDC 2011»
13 years 2 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
13 years 7 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
TCBB
2010
106views more  TCBB 2010»
13 years 2 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro