Sciweavers

51 search results - page 9 / 11
» A DNA Sticker Algorithm for Solving N-Queen Problem
Sort
View
WOB
2003
140views Bioinformatics» more  WOB 2003»
14 years 11 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
15 years 1 months ago
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee
SP
2008
IEEE
100views Security Privacy» more  SP 2008»
15 years 4 months ago
Towards Practical Privacy for Genomic Computation
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...
Somesh Jha, Louis Kruger, Vitaly Shmatikov
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 9 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
14 years 9 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen