Computing the Similarity of Two Sequences with Nested Arc Annotations (2003)

by Jochen Alber , Jens Gramm , Jiong Guo , Rolf Niedermeier
Venue:Theoretical Computer Science
Citations:20 - 2 self

Documents Related by Co-Citation

35 The Longest Common Subsequence Problem for Arc-Annotated Sequences – Tao Jiang, Guo-Hui Lin, Bin Ma, Kaizhong Zhang - 2000
42 Algorithms and Complexity for Annotated Sequence Analysis – Patricia Anne Evans, Dr. Michael, R. Fellows - 1999
27 Pattern Matching for Arc-Annotated Sequences – Jens Gramm, Jiong Guo, Rolf Niedermeier - 2002
33 The longest common subsequence problem for sequences with nested arc annotations – G-H Lin, Z-Z Chen, T Jiang, J Wen
37 Finding common subsequences with arcs and pseudoknots – P Evans - 1999
56 Algorithmic aspects of protein structure similarity – Deborah Goldman, Sorin Istrail Y, Christos H. Papadimitriou Z - 1999
36 Computing similarity between rna strings – Vineet Bafna, S. Muthukrishnan, R. Ravi - 1996
6 Exact Algorithms for the Longest Common Subsequence Problem for Arc-Annotated Sequences – Jiong Guo - 2002
27 Computing similarity between rna structures – K Zhang, L Wang, B Ma
13 What makes the arc-preserving subsequence problem hard ? Trans – Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
314 Simple Fast Algorithms for the Editing distance between Trees and Related Problems – K Zhang, D Shasha - 1989
71 A General Edit Distance between RNA Structures – Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang - 2001
30 On the computational complexity of 2-interval pattern matching problems. Theore – S VIALETTE
9 Alignments of RNA structures – Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, Hélène Touzet
5 Comparing rna structures: towards an intermediate model between the edit and the lapcs problems – Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette - 2007
10 An edit distance between RNA stem-loops – Valentin Guignon, Cedric Chauve, Programme De Bioinformatique, Université De Montréal - 2005
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
14 Towards Optimally Solving the Longest Common Subsequence Problem for Sequences with Nested Arc Annotations in Linear Time – Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier - 2002
30 K.: Edit distance between two RNA structures – G H Lin, B Ma, Zhang - 2001