Sciweavers

198 search results - page 29 / 40
» Genetic algorithms using low-discrepancy sequences
Sort
View
AIPS
2003
15 years 4 months ago
A Multi-Heuristic GA for Schedule Repair in Precast Plant Production
A multi-heuristic schedule repair model for schedule conflict resolution is presented and its application in repairing the schedules of a prefabrication plant is described in this...
Weng Tat Chan, Tan Heng Wee
116
Voted
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
125
Voted
TCS
2008
15 years 3 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
BMCBI
2005
201views more  BMCBI 2005»
15 years 3 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
150
Voted
BMCBI
2008
132views more  BMCBI 2008»
15 years 3 months ago
The SeqWord Genome Browser: an online tool for the identification and visualization of atypical regions of bacterial genomes thr
Background: Data mining in large DNA sequences is a major challenge in microbial genomics and bioinformatics. Oligonucleotide usage (OU) patterns provide a wealth of information f...
Hamilton Ganesan, Anna S. Rakitianskaia, Colin F. ...