Forest alignment with affine gaps and anchors, applied in RNA structure comparison
From MaRDI portal
Publication:390877
DOI10.1016/j.tcs.2012.07.040zbMath1292.68184OpenAlexW2042140268MaRDI QIDQ390877
Robert Giegerich, Stefanie Schirmer
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.040
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)
Related Items
Counting, Generating, Analyzing and Sampling Tree Alignments ⋮ Counting, Generating and Sampling Tree Alignments
Uses Software
Cites Work
- Alignment of trees -- an alternative to tree edit
- Tree edit distance with gaps
- A discipline of dynamic programming over sequence data
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
- How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
- Multiple Genome Alignment: Chaining Algorithms Revisited
- Fast RNA Structure Alignment for Crossing Input Structures
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
- Recognition and parsing of context-free languages in time n3
- A global parser for context-free phrase structure grammars
- Combinatorial Pattern Matching
