6. Algorithmic Aspects of ARC-Annotated Sequences

  1. Mourad Elloumi2 and
  2. Albert Y. Zomaya3
  1. Guillaume Blin,
  2. Maxime Crochemore and
  3. Stéphane Vialette

Published Online: 23 DEC 2010

DOI: 10.1002/9780470892107.ch6

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

How to Cite

Blin, G., Crochemore, M. and Vialette, S. (2011) Algorithmic Aspects of ARC-Annotated Sequences, in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications (eds M. Elloumi and A. Y. Zomaya), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470892107.ch6

Editor Information

  1. 2

    Unit of Technologies of Information and Communication (UTIC) and University of Tunis-El Manar, Tunisia

  2. 3

    School of Information Technologies, The University of Sydney, Australia

Author Information

  1. IGM, University Paris-Est, Champs-sur-Marne, Marne-la-Vallée, France

Publication History

  1. Published Online: 23 DEC 2010
  2. Published Print: 18 JAN 2011

ISBN Information

Print ISBN: 9780470505199

Online ISBN: 9780470892107

SEARCH

Keywords:

  • algorithmic aspects of arc-annotated sequences - structure comparison for RNA, central computational problem bearing computer science challenging questions;
  • longest arc-preserving common subsequence - Evans' LAPCS problem, and two arc-annotated sequences;
  • maximum arc-preserving common subsequence

Summary

This chapter contains sections titled:

  • Introduction

  • Preliminaries

  • Longest Arc-Preserving Common Subsequence

  • Arc-Preserving Subsequence

  • Maximum Arc-Preserving Common Subsequence

  • Edit Distance

  • References