Inducing Suffix and LCP Arrays in External Memory Timo Bingmann∗, Johannes Fischer†, and Vitaly Osipov‡ KIT, Institute of Theoretical Informatics, 76131 Karlsruhe, Germany {timo.bingmann,johannes.fischer,osipov}@ki

First Page		Document Content
Date: 2012-11-28 08:24:55 String computer science) Computing Computer programming Arrays Formal languages LCP array Suffix array Combinatorics on words String Suffix tree Trie Substring		Inducing Suffix and LCP Arrays in External Memory Timo Bingmann∗, Johannes Fischer†, and Vitaly Osipov‡ KIT, Institute of Theoretical Informatics, 76131 Karlsruhe, Germany {timo.bingmann,johannes.fischer,osipov}@ki Add to Reading List Source URL: panthema.net Download Document from Source Website File Size: 524,03 KB Share Document on Facebook

	Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical Sci DocID: 1rk7H - View Document
	A PATTERN EXTRACTION ALGORITHM FOR ABSTRACT MELODIC REPRESENTATIONS THAT ALLOW PARTIAL OVERLAPPING OF INTERVALLIC CATEGORIES Emilios Cambouropoulos1 , Maxime Crochemore2,3 , Costas Iliopoulos3 , Manal Mohamed3 , Marie-Fr DocID: 1rgdB - View Document
	KERNELS AND SIMILARITY MEASURES FOR TEXT CLASSIFICATION Andr´e T. Martins Priberam Inform´atica, and Instituto de Telecomunicac¸o˜ es Instituto Superior T´ecnico, DocID: 1rg2P - View Document
	CSE 584A Class 14 Jeremy Buhler March 9, 2016 The BWT is sufficient for simple pattern matching, but can it do more? DocID: 1rbeK - View Document
	doi:j.ins DocID: 1r4I2 - View Document