RNA structural alignments, part II: non-Sankoff approaches for structural alignments.

Kiyoshi Asai, Michiaki Hamada

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In structural alignments of RNA sequences, the computational cost of Sankoff algorithm, which simultaneously optimizes the score of the common secondary structure and the score of the alignment, is too high for long sequences (O(L (6)) time for two sequences of length L). In this chapter, we introduce the methods that predict the structures and the alignment separately to avoid the heavy computations in Sankoff algorithm. In those methods, neither of those two prediction processes is independent, but each of them utilizes the information of the other process. The first process typically includes prediction of base-pairing probabilities (BPPs) or the candidates of the stems, and the alignment process utilizes those results. At the same time, it is also important to reflect the information of the alignment to the structure prediction. This idea can be implemented as the probabilistic transformation (PCT) of BPPs using the potential alignment. As same as for all the estimation problems, it is important to define the evaluation measure for the structural alignment. The principle of maximum expected accuracy (MEA) is applicable for sum-of-pairs (SPS) score based on the reference alignment.

Original languageEnglish
Pages (from-to)291-301
Number of pages11
JournalMethods in molecular biology (Clifton, N.J.)
Volume1097
DOIs
Publication statusPublished - 2014
Externally publishedYes

Fingerprint

Base Pairing
RNA
Costs and Cost Analysis

ASJC Scopus subject areas

  • Medicine(all)

Cite this

RNA structural alignments, part II : non-Sankoff approaches for structural alignments. / Asai, Kiyoshi; Hamada, Michiaki.

In: Methods in molecular biology (Clifton, N.J.), Vol. 1097, 2014, p. 291-301.

Research output: Contribution to journalArticle

@article{395f549e1935469aa100c82f8f59898e,
title = "RNA structural alignments, part II: non-Sankoff approaches for structural alignments.",
abstract = "In structural alignments of RNA sequences, the computational cost of Sankoff algorithm, which simultaneously optimizes the score of the common secondary structure and the score of the alignment, is too high for long sequences (O(L (6)) time for two sequences of length L). In this chapter, we introduce the methods that predict the structures and the alignment separately to avoid the heavy computations in Sankoff algorithm. In those methods, neither of those two prediction processes is independent, but each of them utilizes the information of the other process. The first process typically includes prediction of base-pairing probabilities (BPPs) or the candidates of the stems, and the alignment process utilizes those results. At the same time, it is also important to reflect the information of the alignment to the structure prediction. This idea can be implemented as the probabilistic transformation (PCT) of BPPs using the potential alignment. As same as for all the estimation problems, it is important to define the evaluation measure for the structural alignment. The principle of maximum expected accuracy (MEA) is applicable for sum-of-pairs (SPS) score based on the reference alignment.",
author = "Kiyoshi Asai and Michiaki Hamada",
year = "2014",
doi = "10.1007/978-1-62703-709-9_14",
language = "English",
volume = "1097",
pages = "291--301",
journal = "Methods in molecular biology (Clifton, N.J.)",
issn = "1064-3745",
publisher = "Humana Press",

}

TY - JOUR

T1 - RNA structural alignments, part II

T2 - non-Sankoff approaches for structural alignments.

AU - Asai, Kiyoshi

AU - Hamada, Michiaki

PY - 2014

Y1 - 2014

N2 - In structural alignments of RNA sequences, the computational cost of Sankoff algorithm, which simultaneously optimizes the score of the common secondary structure and the score of the alignment, is too high for long sequences (O(L (6)) time for two sequences of length L). In this chapter, we introduce the methods that predict the structures and the alignment separately to avoid the heavy computations in Sankoff algorithm. In those methods, neither of those two prediction processes is independent, but each of them utilizes the information of the other process. The first process typically includes prediction of base-pairing probabilities (BPPs) or the candidates of the stems, and the alignment process utilizes those results. At the same time, it is also important to reflect the information of the alignment to the structure prediction. This idea can be implemented as the probabilistic transformation (PCT) of BPPs using the potential alignment. As same as for all the estimation problems, it is important to define the evaluation measure for the structural alignment. The principle of maximum expected accuracy (MEA) is applicable for sum-of-pairs (SPS) score based on the reference alignment.

AB - In structural alignments of RNA sequences, the computational cost of Sankoff algorithm, which simultaneously optimizes the score of the common secondary structure and the score of the alignment, is too high for long sequences (O(L (6)) time for two sequences of length L). In this chapter, we introduce the methods that predict the structures and the alignment separately to avoid the heavy computations in Sankoff algorithm. In those methods, neither of those two prediction processes is independent, but each of them utilizes the information of the other process. The first process typically includes prediction of base-pairing probabilities (BPPs) or the candidates of the stems, and the alignment process utilizes those results. At the same time, it is also important to reflect the information of the alignment to the structure prediction. This idea can be implemented as the probabilistic transformation (PCT) of BPPs using the potential alignment. As same as for all the estimation problems, it is important to define the evaluation measure for the structural alignment. The principle of maximum expected accuracy (MEA) is applicable for sum-of-pairs (SPS) score based on the reference alignment.

UR - http://www.scopus.com/inward/record.url?scp=84908541910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908541910&partnerID=8YFLogxK

U2 - 10.1007/978-1-62703-709-9_14

DO - 10.1007/978-1-62703-709-9_14

M3 - Article

C2 - 24639165

AN - SCOPUS:84908541910

VL - 1097

SP - 291

EP - 301

JO - Methods in molecular biology (Clifton, N.J.)

JF - Methods in molecular biology (Clifton, N.J.)

SN - 1064-3745

ER -