Sciweavers

621 search results - page 49 / 125
» DNA Computing in Microreactors
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Reconstructing Strings from Substrings in Rounds
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
Dimitris Margaritis, Steven Skiena
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
14 years 2 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
ISMIS
2003
Springer
14 years 1 months ago
Evolutionary Computation for Optimal Ensemble Classifier in Lymphoma Cancer Classification
Owing to the development of DNA microarray technologies, it is possible to get thousands of expression levels of genes at once. If we make the effective classification system with ...
Chanho Park, Sung-Bae Cho
EDBT
2010
ACM
117views Database» more  EDBT 2010»
14 years 2 months ago
Anchoring millions of distinct reads on the human genome within seconds
With the advent of next-generation DNA sequencing machines, there is an increasing need for the development of computational tools that can anchor accurately and expediently the m...
Tien Huynh, Michail Vlachos, Isidore Rigoutsos
IPPS
2007
IEEE
14 years 2 months ago
Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
Azzedine Boukerche, Jan Mendonca Correa, Alba Cris...