Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions

DOI10.1007/978-3-642-11440-3_14zbMATH Open1274.92041OpenAlexW1541617928WikidataQ60704259 ScholiaQ60704259MaRDI QIDQ3404437FDOQ3404437

Authors: Guillaume Blin, Sylvie Hamel, Stéphane Vialette 

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00620327/file/hal.pdf

Recommendations

• Extending the Hardness of RNA Secondary Structure Comparison
• RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
• A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
• Computing the similarity of two sequences with nested arc annotations
• A new algorithm for computing similarity between RNA structures

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Cited In (1)

• Extending the Hardness of RNA Secondary Structure Comparison

This page was built for publication: Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404437)