RNA-Folding - From Hardness to Algorithms (Invited Talk)

Author Virginia Vassilevska Williams



PDF
Thumbnail PDF

File

LIPIcs.MFCS.2016.5.pdf
  • Filesize: 208 kB
  • 1 pages

Document Identifiers

Author Details

Virginia Vassilevska Williams

Cite AsGet BibTex

Virginia Vassilevska Williams. RNA-Folding - From Hardness to Algorithms (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, p. 5:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.MFCS.2016.5

Abstract

This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016).
Keywords
  • RNA folding
  • matrix multiplication

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Ruth Nussinov and Ann B.Jacobson. Fast algorithm for predicting the secondary structure of single-stranded RNA. Proceedings of the National Academy of Sciences of the United States of America, 77(11):6309-6313, 1980. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail