Sciweavers

79 search results - page 5 / 16
» The pq-gram distance between ordered labeled trees
Sort
View
JDA
2007
83views more  JDA 2007»
13 years 7 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
BDA
2006
13 years 9 months ago
Integrating Correction into Incremental Validation
Many data on the Web are XML documents. An XML document is an unranked labelled tree. A schema for XML documents (for instance a DTD) is the specification of their internal structu...
Béatrice Bouchou, Ahmed Cheriat, Mirian Hal...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
TALG
2008
81views more  TALG 2008»
13 years 7 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
Reconstructing genome trees of prokaryotes using overlapping genes
Background: Overlapping genes (OGs) are defined as adjacent genes whose coding sequences overlap partially or entirely. In fact, they are ubiquitous in microbial genomes and more ...
Chih-Hsien Cheng, Chung-Han Yang, Hsien-Tai Chiu, ...