By Topic

The SCP and compressed domain analysis of biological sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Adjeroh ; Dept. of Comput. Sci. & Electr. Eng., West Virginia Univ., Morgantown, WV, USA ; J. Feng

We introduce the SCP - the sorted common prefix, and study some of its properties. Based on the internal representations used by a class of new compression schemes, we show how the SCP table can be constructed using an O(u+| Σ |Kmax) number of comparisons on average, and O(u | Σ |) worst case, where u is the size of the sequence, | Σ | is the number of symbols, and Kmax is the maximum SCP value. We describe one application of the SCP to the problem of anchor points in multiple sequence alignment.

Published in:

Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE

Date of Conference:

11-14 Aug. 2003