A general edit distance between RNA structures

T Jiang, G Lin, B Ma, K Zhang - Journal of computational biology, 2002 - liebertpub.com
Arc-annotated sequences are useful in representing the structural information of RNA
sequences. In general, RNA secondary and tertiary structures can be represented as a set of …

Introduction to data mining in bioinformatics

JTL Wang, MJ Zaki, HTT Toivonen… - Data mining in …, 2005 - Springer
The aim of this book is to introduce the reader to some of the best techniques for data mining
in bioinformatics in the hope that the reader will build on them to make new discoveries on …

Algorithmic aspects of protein structure similarity

D Goldman, S Istrail… - 40th Annual Symposium …, 1999 - ieeexplore.ieee.org
We show that calculating contact map overlap (a measure of similarity of protein structures)
is NP-hard, but can be solved in polynomial time for several interesting and relevant special …

Accurate multiple sequence-structure alignment of RNA sequences using combinatorial optimization

M Bauer, GW Klau, K Reinert - BMC bioinformatics, 2007 - Springer
Background The discovery of functional non-coding RNA sequences has led to an
increasing interest in algorithms related to RNA analysis. Traditional sequence alignment …

Algorithms and complexity for annotated sequence analysis

PA Evans - 1999 - dspace.library.uvic.ca
Molecular biologists use algorithms that compare and otherwise analyze sequences that
represent genetic and protein molecules. Most of these algorithms, however, operate on the …

An efficient and accurate approach to identify similarities between biological sequences using pair amino acid composition and physicochemical properties

L Hooshyar, MB Hernández-Jiménez, A Khastan… - Soft Computing, 2024 - Springer
Our study presents a novel method for analyzing biological sequences, utilizing Pairwise
Amino Acid Composition and Amino Acid physicochemical properties to construct a feature …

[HTML][HTML] A polyhedral approach to sequence alignment problems

JD Kececioglu, HP Lenhof, K Mehlhorn… - Discrete applied …, 2000 - Elsevier
We study two new problems in sequence alignment both from a practical and a theoretical
view, using tools from combinatorial optimization to develop branch-and-cut algorithms. The …

Alignments of RNA structures.

G Blin, A Denise, S Dulucq, C Herrbach… - IEEE/ACM Transactions …, 2010 - hal.science
We describe a theoretical unifying framework to express the comparison of RNA structures,
which we call alignment hierarchy. This framework relies on the definition of common …

An improved algorithm for the longest common subsequence problem

SR Mousavi, F Tabataba - Computers & Operations Research, 2012 - Elsevier
Abstract The Longest Common Subsequence problem seeks a longest subsequence of
every member of a given set of strings. It has applications, among others, in data …

Finding common subsequences with arcs and pseudoknots

PA Evans - Annual Symposium on Combinatorial Pattern Matching, 1999 - Springer
This paper examines the complexity of comparing sequences that have arcs linking symbol
pairs. Such arc-annotated sequences can represent molecular sequences with bonds …