Algorithms for testing that sets of DNA words concatenate without secondary structure

Author： Andronescu Mirela   Dees Danielle   Slaybaugh Laura   Zhao Yinglei   Condon Anne   Cohen Barry   Skiena Steven  

Publisher： Springer Publishing Company

ISSN： 1567-7818

Source： Natural Computing, Vol.2, Iss.4, 2003-01, pp. : 391-415

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

GENETIC ALGORITHMS FOR DECISIONAL DNA: SOLVING SETS OF EXPERIENCE KNOWLEDGE STRUCTURE

By Sanin Cesar   Szczerbicki Edward  

Cybernetics and Systems, Vol. 38, Iss. 5-6, 2007-06 ,pp. : 475-494

Taylor & Francis Ltd

Access to resources Recommend Favorite

DNA and quantum based algorithms for VLSI circuits testing

By Singh Amardeep   Bharadwaj Lalit   Harpreet Singh  

Natural Computing, Vol. 4, Iss. 1, 2005-01 ,pp. : 53-72

Springer Publishing Company

Access to resources Recommend Favorite

DISSIMILAR SETS OF EXPERIENCE KNOWLEDGE STRUCTURE: A NEGOTIATION PROCESS FOR DECISIONAL DNA

By Sanin Cesar   Szczerbicki Edward  

Cybernetics and Systems, Vol. 38, Iss. 5-6, 2007-06 ,pp. : 455-473

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets

By Nielsen Michael   Museth Ken  

Journal of Scientific Computing, Vol. 26, Iss. 3, 2006-03 ,pp. : 261-299

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Connected Dominating Sets

By Guha S.   Khuller S.  

Algorithmica, Vol. 20, Iss. 4, 1998-04 ,pp. : 374-387

Springer Publishing Company

Access to resources Recommend Favorite