Edit distance with duplications and contractions revisited. (English)
Giancarlo, Raffaele (ed.) et al., Combinatorial pattern matching. 22nd annual symposium, CPM 2011, Palermo, Italy, June 27‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21457-8/pbk). Lecture Notes in Computer Science 6661, 441-454 (2011).
1
Rich parameterization improves RNA structure prediction. (English)
Bafna, Vineet (ed.) et al., Research in computational molecular biology. 15th annual international conference, RECOMB 2011, Vancouver, BC, Canada, March 28‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20035-9/pbk). Lecture Notes in Computer Science 6577. Lecture Notes in Bioinformatics, 546-562 (2011).
2
Sparse RNA folding: time and space efficient algorithms. (English)
J. Discrete Algorithms 9, No. 1, 12-31 (2011).
3
Edit distance with duplications and contractions revisited (English)
CPM, 441-454 (2011).
4
Rich parameterization improves RNA structure prediction (English)
RECOMB, 546-562 (2011).
5
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approach. (English)
Moulton, Vincent (ed.) et al., Algorithms in bioinformatics. 10th international workshop, WABI 2010, Liverpool, UK, September 6‒8, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15293-1/pbk). Lecture Notes in Computer Science 6293. Lecture Notes in Bioinformatics, 65-77 (2010).
6
Reducing the worst case running times of a family of RNA and CFG problems, using valiant’s approach (English)
WABI, 65-77 (2010).
7
Sparse RNA folding: time and space efficient algorithms. (English)
Kucherov, Gregory (ed.) et al., Combinatorial pattern matching. 20th annual symposium, CPM 2009, Lille, France, June 22‒24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02440-5/pbk). Lecture Notes in Computer Science 5577, 249-262 (2009).
8
Sparse RNA folding: time and space efficient algorithms (English)
CPM, 249-262 (2009).
9
Start
Contact
Print
General Help
