Sciweavers

2455 search results - page 38 / 491
» Computability of Models for Sequence Assembly
Sort
View
DIS
2009
Springer
14 years 3 months ago
Contrasting Sequence Groups by Emerging Sequences
Abstract. Group comparison per se is a fundamental task in many scientific endeavours but is also the basis of any classifier. Contrast sets and emerging patterns contrast betwee...
Kang Deng, Osmar R. Zaïane
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 1 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...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 9 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
CSB
2004
IEEE
115views Bioinformatics» more  CSB 2004»
14 years 12 days ago
PoPS: A Computational Tool for Modeling and Predicting Protease Specificity
Proteases play a fundamental role in the control of intra- and extracellular processes by binding and cleaving specific amino acid sequences. Identifying these targets is extremel...
Sarah E. Boyd, Maria J. García de la Banda,...
GECCO
2000
Springer
123views Optimization» more  GECCO 2000»
14 years 7 days ago
Genomic computing: explanatory modelling for functional genomics
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
Richard J. Gilbert, Jem J. Rowland, Douglas B. Kel...