Sciweavers

202 search results - page 11 / 41
» A Sticker-Based Model for DNA Computation
Sort
View
ISMB
1998
13 years 9 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
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
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
14 years 1 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
GENOMEPOP: A program to simulate genomes in populations
Background: There are several situations in population biology research where simulating DNA sequences is useful. Simulation of biological populations under different evolutionary...
Antonio Carvajal-Rodríguez
RECOMB
1997
Springer
13 years 11 months ago
Sequence alignment with tandem duplication
Algorithm development for comparing and aligning biological sequences has, until recently, been based on the SI model of mutational events which assumes that modi cation of sequen...
Gary Benson