86 search results - page 4 / 18 » DNA Models and Algorithms for NP-Complete Problems |
GCB
2000
Springer
13 years 11 months ago
2000
Springer
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
JIB
2006
13 years 7 months ago
2006
In this study, we seek to develop a predictive model for finding the strength of binding between a particular transcription factor (TF) variant and a particular DNA target variant...
BMCBI
2006
13 years 7 months ago
2006
Background: Existing tools for multiple-sequence alignment focus on aligning protein sequence or protein-coding DNA sequence, and are often based on extensions to Needleman-Wunsch...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
FUIN
2008
13 years 7 months ago
2008
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...