Solving satisfiability problems using a novel microarray-based DNA computer.
Che-Hsin LinHsiao-Ping ChengChang-Biau YangChia-Ning YangPublished in: Biosyst. (2007)
Keyphrases
- microarray
- satisfiability problem
- solving hard
- gene expression
- microarray technology
- stochastic local search
- high throughput
- gene expression data
- microarray data
- np complete
- sat instances
- gene expression profiling
- finite domain
- temporal logic
- experimental conditions
- search algorithm
- gene selection
- gene ontology
- phase transition
- combinatorial problems
- binding sites
- high dimensionality
- gene expression profiles
- davis putnam logemann loveland
- molecular biology
- dna microarray
- sat problem
- gene expression analysis
- combinatorial optimization
- gene networks
- microarray data analysis
- davis putnam
- microarray analysis
- mazurkiewicz traces
- cancer diagnosis
- biological data
- microarray images
- genomic data
- systems biology
- graph coloring problems
- differentially expressed genes
- gene expression datasets
- dna sequences
- regulatory networks
- gene expression data sets
- genome wide
- constraint satisfaction