Local rank distance

Proceedings - 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013

Volumn , Issue , 2013, Pages 219-226

  Ionescu, Radu Tudor ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

Closest string; DNA comparison; Native language identification; Ordinal measure; Phylogenetic analysis; Rank measure; String distance

Indexed keywords

BIOINFORMATICS; COMPUTATION THEORY; DNA; MAMMALS; NATURAL LANGUAGE PROCESSING SYSTEMS;

CLOSEST STRING; NATIVE LANGUAGE; ORDINAL MEASURE; PHYLOGENETIC ANALYSIS; RANK MEASURE; STRING DISTANCE;

HAMMING DISTANCE;

EID: 84904554197     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SYNASC.2013.36     Document Type: Conference Paper

References (30)

1. R. Holmquist, M. M. Miyamoto, and M. Goodman, "Higher-Primate Phylogeny-Why Can't We Decide?" Molecular Biology Evolution, vol. 3, no. 5, pp. 201-216, 1988.
2. M. Chimani, M. Woste, and S. Bocker, "A Closer Look at the Closest String and Closest Substring Problem," Proceedings of ALENEX, pp. 13-24, 2011.
3. F. Vezzi, C. D. Fabbro, A. I. Tomescu, and A. Policriti, "rNA: A fast and accurate short reads numerical aligner." Bioinformatics, vol. 28, no. 1, pp. 123-124, 2012.
4. D. Shapira and J. A. Storer, "Large Edit Distance with Multiple Block Operations," Proceedings of SPIRE, vol. 2857, pp. 369-377, 2003.
5. V. Y. Popov, "Multiple genome rearrangement by swaps and by element duplications," Theoretical Computer Science, vol. 385, no. 1-3, pp. 115-126, 2007.
6. L. P. Dinu and R. T. Ionescu, "An Efficient Rank Based Approach for Closest String and Closest Substring," PLoS ONE, vol. 7, no. 6, p. e37576, 06 2012.
7. -, "Clustering based on Rank Distance with Applications on DNA," Proceedings of ICONIP, vol. 7667, pp. 722-729, 2012.
8. J. Felsenstein, Inferring Phylogenies. Sunderland, Massachusetts: Sinauer Associates, 2004.
9. L. P. Dinu, R. Ionescu, and M. Popescu, "Local Patch Dissimilarity for Images," Proceedings of ICONIP, vol. 7663, pp. 117-126, 2012.
10. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. J. C. H. Watkins, "Text classification using string kernels," Journal of Machine Learning Research, vol. 2, pp. 419-444, 2002.
11. C. Sanderson and S. Guenter, "Short text authorship attribution via sequence kernels, markov chains and author unmasking: An investigation," in Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing. Sydney, Australia: Association for Computational Linguistics, July 2006, pp. 482-491.
12. M. Popescu and L. P. Dinu, "Kernel methods and string kernels for authorship identification: The federalist papers case," in Proceedings of RANLP, Borovets, Bulgaria, September 2007.
13. M. Popescu and C. Grozea, "Kernel methods and string kernels for authorship analysis," in CLEF (Online Working Notes/Labs/Workshop), 2012.
14. L. P. Dinu, "On the classification and aggregation of hierarchies with different constitutive elements," Fundamenta Informaticae, vol. 55, no. 1, pp. 39-50, 2003.
15. L. P. Dinu and A. Sgarro, "A Low-complexity Distance for DNA Strings," Fundamenta Informaticae, vol. 73, no. 3, pp. 361-372, 2006.
16. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reverseals," Soviet Physics Doklady, vol. 10, no. 8, pp. 707-710, 1966.
17. L. P. Dinu and F. Ghetu, "Circular Rank Distance: A New Approach for Genomic Applications," DEXA Workshops, pp. 397-401, 2011.
18. T. S. Cho, S. Avidan, and W. T. Freeman, "The patch transform," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 8, pp. 1489-1501, 2010.
19. C. Barnes, D. B. Goldman, E. Shechtman, and A. Finkelstein, "The PatchMatch Randomized Matching Algorithm for Image Manipulation," Communications of the ACM, vol. 54, no. 11, pp. 103-110, November 2011.
20. M. Li, X. Chen, X. Li, B. Ma, and P. M. B. Vitanyi, "The similarity metric," IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3250-3264, 2004.
21. P. Melsted and J. Pritchard, "Efficient counting of kmers in DNA sequences using a bloom filter," BMC Bioinformatics, vol. 12, no. 1, p. 333, 2011.
22. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, and U. Vishne, "Pattern matching with address errors: rearrangement distances," Proceedings of SODA, pp. 1221-1229, 2006.
23. R. T. Ionescu and M. Popescu, "Speeding Up Local Patch Dissimilarity," Proceedings of ICIAP, vol. 8156, pp. 1-10, 2013.
24. D. E. Knuth, J. H. Morris, and V. R. Pratt, "Fast pattern matching in strings," SIAM Journal of Computing, vol. 6, no. 2, pp. 323-350, 1977.
25. Y. Cao, A. Janke, P. J. Waddell, M. Westerman, O. Takenaka, S. Murata, N. Okada, S. Paabo, and M. Hasegawa, "Conflict among individual mitochondrial proteins in resolving the phylogeny of Eutherian orders," J. Mol. Evol., vol. 47, pp. 307-322, 1998.
26. A. Reyes, C. Gissi, G. Pesole, F. M. Catzeflis, and C. Saccone, "Where Do Rodents Fit? Evidence from the Complete Mitochondrial Genome of Sciurus vulgaris," Mol. Biol. Evol., vol. 17, no. 6, pp. 979-983, 2000.
27. D. Blanchard, J. Tetreault, D. Higgins, A. Cahill, and M. Chodorow, "TOEFL11: A Corpus of Non-Native English," Educational Testing Service, Tech. Rep., 2013.
28. M. Popescu and R. T. Ionescu, "The Story of the Characters, the DNA and the Native Language," Proceedings of the Eighth Workshop on Innovative Use of NLP for Building Educational Applications, pp. 270-278, June 2013.
29. J. Tetreault, D. Blanchard, and A. Cahill, "A report on the first native language identification shared task," Proceedings of the Eighth Workshop on Innovative Use of NLP for Building Educational Applications, pp. 48-57, June 2013.
30. J. S. Taylor and N. Cristianini, Kernel Methods for Pattern Analysis. New York, NY, USA: Cambridge University Press, 2004.