The 2-Interval Pattern Matching Problems and Its Application to ncRNA Scanning

Authors:
Thomas K. Wong;S. M. Yiu;T. W. Lam;Wing-Kin Sung
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong,;Department of Computer Science, The University of Hong Kong, Hong Kong,;Department of Computer Science, The University of Hong Kong, Hong Kong,;School of Computing, National University of Singapore, Singapore, 117543
Venue:
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Year:
2009

Faster genome annotation of non-coding RNA families without loss of accuracy

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
On the computational complexity of 2-interval pattern matching problems

Theoretical Computer Science
Searching Genomes for Noncoding RNA Using FastR

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Sequence-based heuristics for faster annotation of non-coding RNA families

Bioinformatics
Approximating the 2-interval pattern problem

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Hi-index	0.00

This paper focuses on the 2-Interval pattern matching problem for {