Sciweavers

186 search results - page 12 / 38
» A new approach to fragment assembly in DNA sequencing
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 12 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
IJCV
2008
157views more  IJCV 2008»
13 years 6 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
BMCBI
2006
116views more  BMCBI 2006»
13 years 7 months ago
TaxMan: a taxonomic database manager
Background: Phylogenetic analysis of large, multiple-gene datasets, assembled from public sequence databases, is rapidly becoming a popular way to approach difficult phylogenetic ...
Martin Jones, Mark Blaxter
HICSS
2003
IEEE
166views Biometrics» more  HICSS 2003»
14 years 19 days ago
Comparative Genome Annotation for Mapping, Prediction and Discovery of Genes
We have used comparative genome analyses to produce annotated maps for large genomic loci. The first example is a locus on mouse chromosome 9 that is syntenic to human chromosome ...
Claudia Kappen, J. Michael Salbaum
ACST
2006
13 years 8 months ago
PDC: Pattern discovery with confidence in DNA sequences
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Yan Sun, Zijia...