Sciweavers

621 search results - page 57 / 125
» DNA Computing
Sort
View
DNA
2006
Springer
159views Bioinformatics» more  DNA 2006»
14 years 1 months ago
Minimal Parallelism for Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be a...
Tseren-Onolt Ishdorj
EJC
2008
13 years 10 months ago
Pooling spaces associated with finite geometry
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
Tayuan Huang, Kaishun Wang, Chih-wen Weng
SP
2008
IEEE
100views Security Privacy» more  SP 2008»
14 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
WOB
2003
140views Bioinformatics» more  WOB 2003»
13 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....
IMSCCS
2007
IEEE
14 years 4 months ago
Evolutionary Conservation of DNA-Contact residues in DNA-binding Domains
Background: DNA-binding proteins are of utmost importance to gene regulation. The identification of DNA-binding domains is useful for understanding the regulation mechanisms of DN...
Yao-Lin Chang, Huai-Kuang Tsai, Cheng-Yan Kao, Yun...