Sciweavers

735 search results - page 123 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
14 years 2 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
99
Voted
DL
2000
Springer
162views Digital Library» more  DL 2000»
15 years 4 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
CIKM
2010
Springer
14 years 10 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
BMCBI
2004
150views more  BMCBI 2004»
14 years 11 months ago
Cross-species comparison significantly improves genome-wide prediction of cis-regulatory modules in Drosophila
Background: The discovery of cis-regulatory modules in metazoan genomes is crucial for understanding the connection between genes and organism diversity. It is important to quanti...
Saurabh Sinha, Mark D. Schroeder, Ulrich Unnerstal...
SIGMOD
2003
ACM
124views Database» more  SIGMOD 2003»
15 years 12 months ago
Dynamic XML documents with distribution and replication
The advent of XML as a universal exchange format, and of Web services as a basis for distributed computing, has fostered the apparition of a new class of documents: dynamic XML do...
Serge Abiteboul, Angela Bonifati, Gregory Cobena, ...