Sciweavers

51 search results - page 7 / 11
» A DNA Sticker Algorithm for Solving N-Queen Problem
Sort
View
CSB
2002
IEEE
121views Bioinformatics» more  CSB 2002»
15 years 2 months ago
Fast and Sensitive Algorithm for Aligning ESTs to Human Genome
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
Jun Ogasawara, Shinichi Morishita
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
15 years 3 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
IJDMB
2006
90views more  IJDMB 2006»
14 years 9 months ago
An efficient motif discovery algorithm with unknown motif length and number of binding sites
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
Henry C. M. Leung, Francis Y. L. Chin
WALCOM
2007
IEEE
109views Algorithms» more  WALCOM 2007»
14 years 11 months ago
Pattern Matching in Degenerate DNA/RNA Sequences
In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...
M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mou...
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
15 years 10 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...