It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.1K
- Applied Category Theory Course 279
- Applied Category Theory Exercises 138
- Applied Category Theory Discussion Groups 40
- Applied Category Theory Formula Examples 15
- Chat 450
- Azimuth Code Project 107
- News and Information 145
- Azimuth Blog 148
- Azimuth Forum 29
- Azimuth Project 190
- - Strategy 109
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 707
- - Latest Changes 699
- - - Action 14
- - - Biodiversity 8
- - - Books 2
- - - Carbon 9
- - - Computational methods 38
- - - Climate 53
- - - Earth science 23
- - - Ecology 43
- - - Energy 29
- - - Experiments 30
- - - Geoengineering 0
- - - Mathematical methods 69
- - - Meta 9
- - - Methodology 16
- - - Natural resources 7
- - - Oceans 4
- - - Organizations 34
- - - People 6
- - - Publishing 4
- - - Reports 3
- - - Software 20
- - - Statistical methods 2
- - - Sustainability 4
- - - Things to do 2
- - - Visualisation 1
- General 38

Options

## Comments

Hi Reuben, the lab I'm in works on this stuff, and the Dirks et. al paper cited in the paper you linked to came out of our lab. Also this paper reports an \( O(N^5) \) algorithm for pseudoknots. In practice, some people would like to do this for long sequences, say >5000 bases, and then it starts to become impossible to do these calculations. One thing I have been interested in is quantum algorithms, and pseudoknots are actually one of the problems I thought about because while it is bounded in polynomial time, it's still a bigger polynomial. We know from Grover's quantum algorithm we can reduce search times by a quadratic factor, so pulling this down somewhere near \( O(N^{2.2} )\) would bring some biologically interesting sequences within range, if the problem can be recast in that way. In general, I am interested in quantum algorithms across biology, and this might be an interesting problem. I would, of course, be interested in what types of insights might be gained by looking at these types of problems through the lens of category theory. At Oxford where you're at you are probably aware that there is a lot of work being done on categories in quantum theory, and John has written a lot about this as well, which is one of the main motivations for me in taking this course (along with direct applications in biology). I'm hoping to better understand quantum algorithms and quantum computation, and I hope category theory can help.

`Hi Reuben, the lab I'm in works on this stuff, and the Dirks et. al paper cited in the paper you linked to came out of our lab. Also [this paper](http://www.piercelab.caltech.edu/assets/papers/jcc04.pdf) reports an \\( O(N^5) \\) algorithm for pseudoknots. In practice, some people would like to do this for long sequences, say >5000 bases, and then it starts to become impossible to do these calculations. One thing I have been interested in is quantum algorithms, and pseudoknots are actually one of the problems I thought about because while it is bounded in polynomial time, it's still a bigger polynomial. We know from Grover's quantum algorithm we can reduce search times by a quadratic factor, so pulling this down somewhere near \\( O(N^{2.2} )\\) would bring some biologically interesting sequences within range, if the problem can be recast in that way. In general, I am interested in quantum algorithms across biology, and this might be an interesting problem. I would, of course, be interested in what types of insights might be gained by looking at these types of problems through the lens of category theory. At Oxford where you're at you are probably aware that there is a lot of work being done on categories in quantum theory, and John has written a lot about this as well, which is one of the main motivations for me in taking this course (along with direct applications in biology). I'm hoping to better understand quantum algorithms and quantum computation, and I hope category theory can help.`

Awesome, thanks for this reply!

`Awesome, thanks for this reply!`