Referenced Items are not available for this document.
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
- Page(s):
- 587 - 592
- Print ISBN:
- 0-7695-2000-6
- INSPEC Accession Number:
- 7906408
- Digital Object Identifier :
- 10.1109/CSB.2003.1227416
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
