Skip to main content
16 events
when toggle format what by license comment
Nov 4 at 20:10 comment added Darlingtonia Constructing a phylogenetic tree for N taxa.
Jan 14, 2019 at 3:01 comment added user3658307 I think this is a great question but it may have been misunderstood to mean literally NP-hard problems in bioinformatics, whereas it is really seemingly asking about hard computational problems that would be of great use in biology or bioinformatics. Perhaps it should be reasked here.
Dec 3, 2017 at 13:53 comment added user22020 Molecular distance geometry problem is well known to be NP hard, in 3 dimensions.
Dec 2, 2017 at 18:27 answer added Artem Kaznatcheev timeline score: 1
Nov 11, 2015 at 0:37 comment added user137 @MattiaRovetta Here is a related paper
Nov 11, 2015 at 0:25 answer added SmallChess timeline score: 3
May 25, 2014 at 14:16 comment added Behzad Rowshanravan Hope the below answer is somewhat helpful.
May 25, 2014 at 14:07 answer added Behzad Rowshanravan timeline score: 4
May 17, 2014 at 18:08 history edited Colton CC BY-SA 3.0
added 71 characters in body
Apr 17, 2014 at 11:40 comment added Mattia Rovetta Just a curiosity: an NP-complete problem (Hamiltonian path) solved with molecular computing ncbi.nlm.nih.gov/m/pubmed/7973651
Apr 17, 2014 at 11:28 history tweeted twitter.com/#!/StackBiology/status/456756150264807424
Apr 17, 2014 at 10:22 comment added Remi.b Why has this question been downvoted? btw, this post might interest you @Colton
Apr 17, 2014 at 9:14 review Close votes
Apr 21, 2014 at 22:25
Apr 17, 2014 at 6:49 comment added skymningen Try asking this on biostars.org, the people there probably have thought more often about the question if a problem is np-hard.
Apr 17, 2014 at 4:54 review First posts
Apr 17, 2014 at 7:55
Apr 17, 2014 at 4:37 history asked Colton CC BY-SA 3.0