Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots (extended abstract)

  • Philippe Rinaudo
  • , Yann Ponty
  • , Dominique Barth
  • , Alain Denise

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a general setting for structure-sequence comparison in a large class of RNA structures, that unifies and generalizes a number of recent works on specific families of structures. Our approach is based on a tree decomposition of structures, and gives rise to a general parameterized algorithm having complexity in O(N·m t), where N (resp. m) is the structure (resp. sequence) length, and the exponent t depends on the family of structures. For each family considered by previous approaches, our contribution specializes into an algorithm whose complexity either matches or outperforms previous solutions.

Original languageEnglish
Title of host publicationAlgorithms in Bioinformatics - 12th International Workshop, WABI 2012, Proceedings
Pages149-164
Number of pages16
DOIs
Publication statusPublished - 1 Oct 2012
Event12th International Workshop on Algorithms in Bioinformatics, WABI 2012 - Ljubljana, Slovenia
Duration: 10 Sept 201212 Sept 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7534 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Workshop on Algorithms in Bioinformatics, WABI 2012
Country/TerritorySlovenia
CityLjubljana
Period10/09/1212/09/12

Fingerprint

Dive into the research topics of 'Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots (extended abstract)'. Together they form a unique fingerprint.

Cite this