Author of the publication

NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots.

, , , and . DNA, volume 5877 of Lecture Notes in Computer Science, page 106-115. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications., and . J. Comput. Biol., 14 (1): 16-32 (2007)Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis., , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 265-275. Springer, (2008)Linear Time Algorithm for Parsing RNA Secondary Structure., and . WABI, volume 3692 of Lecture Notes in Computer Science, page 341-352. Springer, (2005)Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems., , and . DNA, volume 7433 of Lecture Notes in Computer Science, page 43-57. Springer, (2012)On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences., and . DNA, volume 9211 of Lecture Notes in Computer Science, page 181-193. Springer, (2015)NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots., , , and . DNA, volume 5877 of Lecture Notes in Computer Science, page 106-115. Springer, (2009)A Theory of Strict P-completeness.. STACS, volume 577 of Lecture Notes in Computer Science, page 33-44. Springer, (1992)A System-Level Specification Framework for I/O Architectures., , , and . SPAA, page 138-147. ACM, (1999)Lamport Clocks: Verifying a Directory Cache-Coherence Protocol., , , and . SPAA, page 67-76. ACM, (1998)Toward a decidable notion of sequential consistency., , and . SPAA, page 304-313. ACM, (2003)