Sciweavers

26 search results - page 5 / 6
» dna 2001
Sort
View
WABI
2001
Springer
134views Bioinformatics» more  WABI 2001»
14 years 2 months ago
Comparing Assemblies Using Fragments and Mate-Pairs
Using current technology, large consecutive stretches of DNA (such as whole chromosomes) are usually assembled from short fragments obtained by shotgun sequencing, or from fragment...
Daniel H. Huson, Aaron L. Halpern, Zhongwu Lai, Eu...
BIBE
2001
IEEE
188views Bioinformatics» more  BIBE 2001»
14 years 1 months ago
Interrelated Two-way Clustering: An Unsupervised Approach for Gene Expression Data Analysis
DNA arrays can be used to measure the expression levels of thousands of genes simultaneously. Currently most research focuses on the interpretation of the meaning of the data. How...
Chun Tang, Li Zhang, Aidong Zhang, Murali Ramanath...
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 10 months ago
Learning to recognize brain specific proteins based on low-level features from on-line prediction servers
During the last decade, the area of bioinformatics has produced an overwhelming amount of data, with the recently published draft of the human genome being the most prominent exam...
Henrik Boström, Joakim Cöster, Lars Aske...
RECOMB
2001
Springer
14 years 10 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 2 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...