75 search results - page 14 / 15 » Optimal Suffix Tree Construction with Large Alphabets |
CCGRID
2010
IEEE
13 years 3 months ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
VLDB
2005
ACM
13 years 11 months ago
2005
ACM
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...