Bioinformatics · 2020 · 17 citations · 9 references
Life SciencesBioinformaticsMolecular BiologyRna ProcessingSequence AnalysisStructural BioinformaticsNucleic Acid StructureRna StructureSequence AlignmentStructural AlignmentComputational Alignment AlgorithmsEdit DistancePseudoknotsRna PseudoknotsRna Secondary StructureSecondary Rna StructureSecondary Structure AlignmentWorst-case Complexity
SUMMARY: Current methods for comparing RNA secondary structures are based on tree representations and exploit edit distance or alignment algorithms. Most of them can only process structures without pseudoknots. To overcome this limitation, we introduce ASPRAlign, a Java tool that aligns particular algebraic tree representations of RNA. These trees neglect the primary sequence and can handle structures with arbitrary pseudoknots. A measure of comparison, called ASPRA distance, is computed with a worst-case time complexity of O(n2) where n is the number of nucleotides of the longer structure. AVAILABILITY AND IMPLEMENTATION: ASPRAlign is implemented in Java and source code is released under the GNU GPLv3 license. Code and documentation are freely available at https://github.com/bdslab/aspralign. CONTACT: luca.tesei@unicam.it. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
9
Pseudoknots: RNA Structures with Diverse Functions
David W. Staple, Samuel E. Butcher · PLoS Biology · 2005 · 366 citations · Full text
Life Sciences, Molecular Biology, Structural Biochemistry +14
RNA STRAND: The RNA Secondary Structure and Statistical Analysis Database
Mirela Andronescu, Vera Bereg, Holger H. Hoos et al. · BMC Bioinformatics · 2008 · 287 citations · Full text
Alignment of trees — an alternative to tree edit
Tao Jiang · Theoretical Computer Science · 1995 · 242 citations