Edit distance between two RNA structures
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Alignment between Two RNA Structures
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
The Longest Common Subsequence Problem for Arc-Annotated Sequences
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Computing the similarity of two sequences with nested arc annotations
Theoretical Computer Science
Pattern matching for arc-annotated sequences
ACM Transactions on Algorithms (TALG)
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Information Processing Letters
Constrained sequence alignment: A general model and the hardness results
Discrete Applied Mathematics
Algorithms for computing variants of the longest common subsequence problem
Theoretical Computer Science
Fast RNA Structure Alignment for Crossing Input Structures
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Fast Arc-Annotated Subsequence Matching in Linear Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Comparing RNA structures: towards an intermediate model between the edit and the LAPCS problems
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
Theoretical Computer Science
Parameterized complexity of the arc-preserving subsequence problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Fast RNA structure alignment for crossing input structures
Journal of Discrete Algorithms
How to compare arc-annotated sequences: the alignment hierarchy
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Local gapped subforest alignment and its application in finding RNA structural motifs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
What makes the arc-preserving subsequence problem hard?
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
What makes the arc-preserving subsequence problem hard?
Transactions on Computational Systems Biology II
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Normalized similarity of RNA sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Structural alignment of pseudoknotted RNA
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Parameterized algorithms for inclusion of linear matchings
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Local exact pattern matching for non-fixed RNA structures
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Common structured patterns in linear graphs: approximation and combinatorics
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Extending the hardness of RNA secondary structure comparison
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
The longest common subsequence problem with crossing-free arc-annotated sequences
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |