Sciweavers

BMCBI
2011
13 years 1 days ago
Flexible taxonomic assignment of ambiguous sequencing reads
Background: To characterize the diversity of bacterial populations in metagenomic studies, sequencing reads need to be accurately assigned to taxonomic units in a given reference ...
José Carlos Clemente, Jesper Jansson, Gabri...
ECCC
2006
112views more  ECCC 2006»
13 years 5 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
13 years 9 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
WWW
2008
ACM
14 years 5 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
14 years 6 months ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...