Result 1 to 20 of 52 total
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
Regular language constrained sequence alignment revisited. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 404-415 (2011).
3
Sparse RNA folding: time and space efficient algorithms. (English)
J. Discrete Algorithms 9, No. 1, 12-31 (2011).
4
Edit distance with duplications and contractions revisited (English)
CPM, 441-454 (2011).
5
Rich parameterization improves RNA structure prediction (English)
RECOMB, 546-562 (2011).
6
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).
7
Gene bi-targeting by viral and human mirnas. (English)
BMC Bioinform. 11, 249 (2010).
8
SA-REPC ‒ sequence alignment with regular expression path constraint. (English)
Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 451-462 (2010).
9
SA-REPC - sequence alignment with regular expression path constraint (English)
LATA, 451-462 (2010).
10
Reducing the worst case running times of a family of RNA and CFG problems, using valiant’s approach (English)
WABI, 65-77 (2010).
11
Regular language constrained sequence alignment revisited (English)
IWOCA, 404-415 (2010).
12
Rnaslider: a faster engine for consecutive windows folding and its application to the analysis of genomic folding asymmetry. (English)
BMC Bioinform. 10 (2009).
13
Fast algorithms for computing tree LCS. (English)
Theor. Comput. Sci. 410, No. 43, 4303-4314 (2009).
14
Speeding up HMM decoding and training by exploiting sequence repetitions. (English)
Algorithmica 54, No. 3, 379-399 (2009).
15
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).
16
Sparse RNA folding: time and space efficient algorithms (English)
CPM, 249-262 (2009).
17
Approximate labelled subtree homeomorphism. (English)
J. Discrete Algorithms 6, No. 3, 480-496 (2008).
18
A faster algorithm for RNA co-folding. (English)
Crandall, Keith A. (ed.) et al., Algorithms in bioinformatics. 8th international workshop, WABI 2008, Karlsruhe, Germany, September 15‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87360-0/pbk). Lecture Notes in Computer Science 5251. Lecture Notes in Bioinformatics, 174-185 (2008).
19
Fast algorithms for computing tree LCS. (English)
Ferragina, Paolo (ed.) et al., Combinatorial pattern matching. 19th annual symposium, CPM 2008, Pisa, Italy, June 18‒20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69066-5/pbk). Lecture Notes in Computer Science 5029, 230-243 (2008).
20
Result 1 to 20 of 52 total
Start
Contact
Print
General Help
