Abstract
Granular computing uses granules as basic units to compute with. Granules can be formed by either information abstraction or information decomposition. In this paper, we view information decomposition as a paradigm for processing data with complex structures. More specifically, we apply lossless information decomposition to protein sequence analysis. By decomposing a protein sequence into a set of proper granules and applying dynamic programming to align the position sequences of two corresponding granules, we are able to distribute the calculation of pairwise similarity of protein sequences to multiple parallel processes, each of which is less time consuming than the calculation based on an alignment of original sequences.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Yao, Y.: The Art of Granular Computing. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 101–112. Springer, Heidelberg (2007)
Zadeh, L.: Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems. Soft Computing, 23–25 (1998)
Yao, J.T.: Recent Developments in Granular Computing: A Bibliometrics Study. In: Proceedings of IEEE International Conference on Granular Computing, Hangzhou, China, pp. 74–79 (2008)
Yao, J.T.: A Ten-Year Review of Granular Computing. In: Proceedings of 2007 IEEE International Conference on Granular Computing, Sillicon Valley, CA, USA, pp. 734–739 (2007)
Lin, T.: Granular computing of binary relations I: data mining and neighborhood systems. In: Polkowski, Skowron (eds.) Rough Sets and Knowledge Discovery, pp. 107–121. Physica-Verlag (1998)
Lin, T.Y.: A Roadmap from Rough Set Theory to Granular Computing. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 33–41. Springer, Heidelberg (2006)
Yao, Y., Liau, C., Zhong, N.: Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 152–159. Springer, Heidelberg (2003)
Yao, Y.: Information granulation and rough set approximation. International Journal of Intelligent Systems, 87–104 (2001)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasonging about Data. Kluwer Academic Publishers (1991)
Needleman, B., Wunsch, D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 443–453 (1970)
Smith, F., Waterman, S.: Identification of Common Molecular Subsequences. Journal of Molecular Biology, 195–197 (1981)
Leslie, C., Eskin, E., Weston, J., Noble, W.: Mismatch String Kernels for SVM Protein Classification. In: Advances in Neural Information Processing Systems, NIPS 2002, Vancouver, British Columbia, Canada, December 9-14, pp. 1417–1424 (2002)
Akkoc, C., Johnsten, T., Benton, R.: Multi-layered Vector Spaces for Classifying and Analyzing Biological Sequences. In: Proceedings of 2011 International Conference on Bioinformatics and Computational Biology, New Orleans, pp. 160–166 (2011)
Liao, L., Noble, S.: Combining pairwise sequence similarity and support vector machines for detecting remote protein evolutionary and structural relationships. Journal of Computational Biology, 857–868 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, Y., Fisher, J., Raghavan, V.V., Johnsten, T., Akkoc, C. (2012). Granular Approach for Protein Sequence Analysis. In: Yao, J., et al. Rough Sets and Current Trends in Computing. RSCTC 2012. Lecture Notes in Computer Science(), vol 7413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32115-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-32115-3_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32114-6
Online ISBN: 978-3-642-32115-3
eBook Packages: Computer ScienceComputer Science (R0)