Sciweavers

181 search results - page 16 / 37
» Hybrid Genetic Algorithm for DNA Sequencing with Errors
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...
RECOMB
2010
Springer
14 years 2 months ago
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples
Abstract. Metagenomics is the study of microbial communities sampled directly from their natural environment, without prior culturing. Among the computational tools recently develo...
Yu-Wei Wu, Yuzhen Ye
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
14 years 1 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, ...
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
13 years 11 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
BMCBI
2005
201views more  BMCBI 2005»
13 years 7 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota