Sciweavers

1192 search results - page 110 / 239
» Computing Weakest Readings
Sort
View
129
Voted
ISMB
1998
15 years 4 months ago
Sequence Assembly Validation by Multiple Restriction Digest Fragment Coverage Analysis
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. This report examines the possibility of analyzing multiple,...
Eric C. Rouchka, David J. States
121
Voted
ANLP
1994
113views more  ANLP 1994»
15 years 4 months ago
Acquiring Knowledge From Encyclopedic Texts
A computational model for the acquisition of knowledge from encyclopedic texts is described. The model has been implemented in a program, called SNOWY, that reads unedited texts f...
Fernando Gomez, Richard D. Hull, Carlos Segami
105
Voted
BIB
2010
68views more  BIB 2010»
15 years 3 months ago
Genome variation discovery with high-throughput sequencing data
The advent of high-throughput sequencing (HTS) technologies is enabling sequencing of human genomes at a significantly lower cost. The availability of these genomes is hoped to en...
Adrian V. Dalca, Michael Brudno
102
Voted
JFR
2006
72views more  JFR 2006»
15 years 3 months ago
KAT-5: Robust systems for autonomous vehicle navigation in challenging and unknown terrain
Kat-5 was the fourth vehicle to make history in DARPA's 2005 Grand Challenge, where for the first time ever, autonomous vehicles were able to travel through 100 miles of roug...
Paul G. Trepagnier, Jorge Nagel, Powell M. Kinney,...
117
Voted
MFCS
2010
Springer
15 years 2 months ago
Persistent Homology under Non-uniform Error
Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classe...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber...