155 search results - page 9 / 31 » Dynamic Succinct Ordered Trees |
WWW
2006
ACM
15 years 10 months ago
2006
ACM
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
165
Voted
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
102
click to vote
CDC
2008
IEEE
14 years 11 months ago
2008
IEEE
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
BMCBI
2010
14 years 9 months ago
2010
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...