Sciweavers

599 search results - page 20 / 120
» The repeater tree construction problem
Sort
View
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
14 years 9 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...
BMCBI
2008
125views more  BMCBI 2008»
14 years 9 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
JAIR
2008
94views more  JAIR 2008»
14 years 9 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
15 years 3 months ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
WEBDB
2005
Springer
151views Database» more  WEBDB 2005»
15 years 3 months ago
Constructing Maintainable Semantic Mappings in XQuery
Semantic mapping is one of the important components underlying the data sharing systems. As is known, constructing and maintaining such mappings both are necessary yet extremely h...
Gang Qian, Yisheng Dong