Sciweavers

2366 search results - page 312 / 474
» Mapping time
Sort
View
CSB
2005
IEEE
129views Bioinformatics» more  CSB 2005»
15 years 9 months ago
ssahaSNP A Polymorphism Detection Tool on a Whole Genome Scale
We present a software package which can detect homozygous SNPs and indels on a eukaryotic genome scale from millions of shotgun reads. Matching seeds of a few kmer words are found...
Zemin Ning, Mario Cáccamo, James C. Mulliki...
125
Voted
RTAS
2006
IEEE
15 years 9 months ago
Memory Footprint Reduction with Quasi-Static Shared Libraries in MMU-less Embedded Systems
Despite a rapid decrease in the price of solid state memory devices, system memory is still a very precious resource in embedded systems. The use of shared libraries is known to b...
Jaesoo Lee, Jiyong Park, Seongsoo Hong
192
Voted
BMCBI
2011
14 years 7 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
124
Voted
ECCC
2006
145views more  ECCC 2006»
15 years 3 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
127
Voted
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 7 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
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...
David Bryant