doi:j.ins

First Page		Document Content
Date: 2008-10-22 02:35:21 Theory of computation Dynamic programming Maximal pair String Mathematics String searching algorithm Suffix tree Approximate string matching Time complexity Algorithm Computer science		doi:j.ins Add to Reading List Source URL: pbil.univ-lyon1.fr Download Document from Source Website File Size: 510,66 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