Versatile string kernels

Theoretical Computer Science

Volumn 495, Issue , 2013, Pages 50-65

  Elzinga, Cees H ^a   Wang, Hui ^b,c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b UNIVERSITY OF ULSTER   (United Kingdom)

^c National Normal College of Inner Mongolia   (China)

Author keywords

Gap penalizing; Partial rankings; Run length encoding; Soft matching; String kernel; String matching; Subsequences

Indexed keywords

GAP-PENALIZING; PARTIAL RANKINGS; RUN-LENGTH ENCODING; SOFT MATCHING; STRING KERNEL; STRING MATCHING; SUBSEQUENCES;

BIOINFORMATICS; IMAGE PROCESSING;

WEIGHING;

EID: 84880247615     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2013.06.006     Document Type: Article

References (51)

1. N. Ailon Aggregation of partial rankings, p-ratings and top-m lists Algorithmica 57 2 2010 284 300
2. M.S. Bansal, and D. Fernández-Baca Computing distances between partial rankings Inform. Process. Lett. 109 4 2009 238 241
3. M. Barski, U. Stege, A. Thomo, and C. Upton Shortest path approaches for the longest common subsequence of a set of strings Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering (BIBE2007) 2007 IEEE
4. A. Ben-Hur, C.S. Ong, S. Sonnenburg, B. Schölkopf, and G. Rätsch Support vector machines and kernels for computational biology PLoS Comput. Biol. 4 10 2008
5. H. Bras, A.C. Liefbroer, and C.H. Elzinga Standardization of pathways to adulthood? An analysis of Dutch cohorts born between 1850 and 1900 Demography 47 4 2010 1013 1034
6. C. Brzinsky-Fay Lost in transition? Labour market entry sequences of school leavers in Europe Eur. Sociol. Rev. 23 4 2007 409 422
7. S. Chen, B. Ma, and K. Zhang On the similarity metric and the distance metric Theoret. Comput. Sci. 410 24-25 2009 2365 2376
8. D. Croce, A. Moschitti, and R. Basili Structured lexical similarity via convolution kernels on dependency trees Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, Association for Computational Linguistics 2011
9. M. Crochemore, L. Illiec, and W. Rytter Repetitions in strings: Algorithms and combinatorics Theoret. Comput. Sci. 410 50 2009 5227 5235
10. M. Crochemore, G. Landau, and M. Ziv-Ukelson A subquadratic sequence alignment algorithm for unrestricted scoring matrices SIAM J. Comput. 32 6 2003 1654 1673
11. E. Egho, C. Raïssi, T. Calders, T. Bourquard, N. Jay, and A. Napoli On measuring similarity for sequences of itemsets Research Report 8086 October 2012 INRIA, Nancy Grand Est France
12. C.H. Elzinga Sequence similarity - a non-aligning technique Sociol. Methods Res. 31 4 2003 3 29
13. C.H. Elzinga Combinatorial representation of token sequences J. Classification 22 1 2005 87 118
14. C.H. Elzinga, and A.C. Liefbroer De-standardization and differentiation of family life trajectories of young adults: A cross-national comparison using sequence analysis Eur. J. Popul. 23 3-4 2007 225 250
15. C.H. Elzinga, S. Rahmann, and H. Wang Algorithms for subsequence combinatorics Theoret. Comput. Sci. 409 3 2008 394 404
16. C.H. Elzinga, and H. Wang Kernels for acyclic digraphs Pattern Recognit. Lett. 33 2012 2239 2244
17. C.H. Elzinga, H. Wang, Z. Lin, and Y. Kumar Concordance and consensus Inform. Sci. 181 2011 2529 2549
18. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee Comparing partial rankings SIAM J. Discrete Math. 20 3 2006 628 648
19. V. Freschi, and A. Bogliolo Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism Inform. Process. Lett. 90 2004 167 173
20. A. Gabadinho, G. Ritschard, N.S. Müller, and M. Studer Analyzing and visualizing state sequences in R with TraMineR J. Stat. Softw. 40 4 2011 1 37
21. D.M. Gusfield Algorithms on Strings, Trees and Sequences, Computer Science and Computational Biology 1997 Cambridge University Press Cambridge
22. D. Haussler Convolution kernels on discrete structures Tech. Rep. UCSC-CRL-99-10 1999 University of California, Computer Science Department Santa Cruz
23. M.N. Hollister Is optimal matching sub-optimal? Sociol. Methods Res. 38 2009 235 264
24. A. Iványi On the d-complexity of words Ann. Univ. Sci. Budapest. Sect. Comput. 8 1987 69 90
25. Z. Kása On the d-complexity of strings Pure Math. Appl. 1-2 1998 119 128
26. Z. Kása On scattered subwords Acta Univ. Sapientiae Inform. 3 2011 127 136
27. S.-C. Kim, and E.-S. Kim Fast computation of hologram patterns of a 3D object using run-length encoding and novel look-up table methods Appl. Optics 48 6 2009 1030 1041
28. D.E. Knuth Two notes on notation Selected Papers on Discrete Mathematics 2003 Center for the Study of Language and Information Stanford (MA) 15 44 (Chapter 2)
29. F. Legendre, T. Robillard, L. Desutter-Grandcolas, M.F. Whiting, and P. Grandcolas Phylogenetic analysis of non-stereotyped behavioural sequences with a successive event-pairing method Biol. J. Linnean Society 94 2008 853 867
30. D. Lemire, O. Kaser, and K. Aouiche Sorting improves word-aligned bitmap indexes Data Know. Engrg. 69 1 2010 3 28
31. C. Leslie, E. Erskin, and W.S. Noble The spectrum kernel: a string kernel for SVM proteine classification R. Altman, A. Dunker, L. Hunter, K. Lauderdale, T. Klein, Proceedings of the Pacific Symposium of Biocomputing, vol. 7 2002 World Scientific Publishing Company
32. A.C. Liefbroer, and C.H. Elzinga Intergenerational transmission of behavioral patterns: How similar are parentś and childreńs demographic trajectories Adv. Life Course Res. 17 1 2012 1 10
33. Z. Lin, H. Wang, and S. McClean Measuring tree similarity in spatial and sequential spaces IEEE Trans. Pattern Anal. Mach. Intell. 24 2 2012 197 208
34. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins Text classification using string kernels J. Mach. Learn. Res. 2 2002 419 444
35. C. Messom, G. Sen Gupta, and S. Demidenko Hough transform run length encoding for real-time image processing IEEE Trans. Instrum. Meas. 56 3 2007 962 967
36. C.D. Meyer Matrix Analysis and Applied Linear Algebra 2000 Society for Industrial and Applied Mathematics (SIAM) Philadelphia, PA
37. A. Moschitti Efficient convolution kernels for dependency trees and constituent syntactic trees J. Fürnkranz, T. Scheffer, M. Spiliopoulou, Machine Learning: ECML 2006 Lecture Notes in Comput. Sci. vol. 4212 2006 Springer 318 329
38. A. Moschitti Kernel methods, syntax and semantics for relational text categorization CIKM É08 Proceedings of the 17th ACM Conference on Information and Knowledge Management 2008 ACM
39. A. Moschitti Syntactic and semantic kernels for short text pair categorization Proceedings of the 12th Conference of the Eropean Chapter of the ACL 2009
40. S.B. Needleman, and C.D. Wunsch A general method applicable to the search for similarities in the amino acid sequence of two proteins J. Mol. Biol. 48 3 1970 443 453
41. S. Pakalapati, S. Beaver, J.A. Romagnoli, and A. Palazoglu Sequencing diurnal air flow patterns for ozone exposure assessment around Houston, Texas Atmos. Environ. 43 3 2009 715 723
42. S. Rahmann Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms M. Lewenstein, G. Valiente, Combinatorial Pattern Matching (CPM) Lecture Notes in Comput. Sci. 2006 Springer New York 153 164
43. D. Sankoff, and J.B. Kruskal Time Warps, String Edits and Macro-Molecules. The Theory and Practice of String Comparison 1983 Addison-Wesley Reading
44. B. Schölkopf, J. Weston, E. Eskin, C. Leslie, and W.S. Noble A kernel approach for learning from almost orthogonal patterns Machine Learning: ECML 2002 Lecture Notes in Comput. Sci. vol. 2430 2002 Springer 151 167
45. J. Shawe-Taylor, and N. Christianini Kernel Methods for Pattern Recognition 2004 Cambridge University Press Cambridge
46. M. Studer Analyse de données séquentielles et application à lÉétude des inégalités sociales en début de carrière académique PhD thesis 2012 Faculté des sciences économiques et sociales de lÉUniversité de Genève
47. H. Wang, All common subsequences, in: M.M. Veloso (Ed.), IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007.
48. H. Wang, and Z. Lin A novel algorithm for counting all common subsequences 2007 IEEE Conference on Granular Computing 2007 IEEE
49. M.S. Waterman Introduction to Computational Biology, Interdisciplinary Statistics 1995 Chapman & Hall/CRC Boca Raton
50. C. Watkins Dynamic alignment kernels A. Smola, P. Bartlett, B. Schölkopf, D. Schuurmans, Advances in Large Margin Classifiers 2002 MIT Press 39 50
51. J. Weston, B. Schölkopf, E. Eskin, C. Leslie, and W. Stafford Noble Dealing with large diagonals in kernel matrices Ann. Inst. Statist. Math. 55 2 2003 391 408