What Makes the Arc-Preserving Subsequence Problem Hard?-Reference-Cited by-同舟云学术

What Makes the Arc-Preserving Subsequence Problem Hard?

Published:2005 Issue: Volume: Page:1-36
ISSN:0302-9743
Container-title:Transactions on Computational Systems Biology II
language:
Short-container-title:

Author:

Blin Guillaume,Fertin Guillaume,Rizzi Romeo,Vialette Stéphane

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11567752_1

Reference24 articles.

1. Lecture Notes in Computer Science;J. Alber,2002

2. Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Computing the similarity of two sequences with nested arc annotations. Theoretical Computer Science 312(2-3), 337–358 (2004)

3. Billoud, B., Guerrucci, M.-A., Masselot, M., Deutsch, J.S.: Cirripede phylogeny using a novel approach: Molecular morphometrics. Molecular Biology and Evolution 19, 138–148 (2000)

4. Caetano-Anolls, G.: Tracing the evolution of RNA structure in ribosomes. Nucl. Acids. Res. 30, 2575–2587 (2002)

5. Chaia, W., Stewart, V.: RNA Sequence Requirements for NasR-mediated, Nitrate-responsive Transcription Antitermination of the Klebsiella oxytoca M5al nasF Operon Leader. Journal of Molecular Biology 292, 203–216 (1999)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Fast longest crossing-plain preserving common subsequence algorithm;International Journal of Information Technology;2022-08-22

2. Structural relation matching: an algorithm to identify structural patterns into RNAs and their interactions;Journal of Integrative Bioinformatics;2021-05-28

3. Searching RNA Substructures with Arbitrary Pseudoknots;Advances in Intelligent Systems and Computing;2020-07-23

4. Algorithmic Aspects of ARC-Annotated Sequences;Algorithms in Computational Molecular Biology;2010-12-23

5. Fast Arc-Annotated Subsequence Matching in Linear Space;Algorithmica;2010-09-16