Sciweavers

202 search results - page 29 / 41
» A Sticker-Based Model for DNA Computation
Sort
View
RECONFIG
2009
IEEE
182views VLSI» more  RECONFIG 2009»
14 years 2 months ago
Scalability Studies of the BLASTn Scan and Ungapped Extension Functions
BLASTn is a ubiquitous tool used for large scale DNA analysis. Detailed profiling tests reveal that the most computationally intensive sections of the BLASTn algorithm are the sc...
Siddhartha Datta, Ron Sass
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 11 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
CIBCB
2005
IEEE
13 years 9 months ago
A Transcriptional Approach to Gene Clustering
— We present an integrative method for clustering coregulated genes and elucidating their underlying regulatory mechanisms. We use multi-state partition functions and thermodynam...
Ilias Tagkopoulos
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
Pol II promoter prediction using characteristic 4-mer motifs: a machine learning approach
Background: Eukaryotic promoter prediction using computational analysis techniques is one of the most difficult jobs in computational genomics that is essential for constructing a...
Firoz Anwar, Syed Murtuza Baker, Taskeed Jabid, Md...
RECOMB
2005
Springer
14 years 8 months ago
Modeling the Combinatorial Functions of Multiple Transcription Factors
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
Chen-Hsiang Yeang, Tommi Jaakkola