Sciweavers

680 search results - page 120 / 136
» A randomized embedding algorithm for trees
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 9 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
DAM
2010
112views more  DAM 2010»
13 years 8 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 8 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
DKE
2002
137views more  DKE 2002»
13 years 8 months ago
Reasoning for Web document associations and its applications in site map construction
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...
K. Selçuk Candan, Wen-Syan Li
BMCBI
2008
128views more  BMCBI 2008»
13 years 8 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich