Sciweavers

2583 search results - page 132 / 517
» On the Representation of Timed Polyhedra
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 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
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
16 years 7 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
ICALP
2007
Springer
16 years 16 days ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
CIKM
2005
Springer
15 years 12 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
FOCS
1994
IEEE
15 years 10 months ago
Finding the k Shortest Paths
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
David Eppstein