CSE 181 Project guidelines

First Page		Document Content
Date: 2012-11-08 10:11:00 Formal languages Mathematics Bioinformatics Computational phylogenetics Combinatorics Software engineering FASTA Substring String searching algorithm Matching String Pattern matching		CSE 181 Project guidelines Add to Reading List Source URL: www.cs.bilkent.edu.tr Download Document from Source Website File Size: 803,98 KB Share Document on Facebook

	Memory Efficient Minimum Substring Partitioning Yang Li, Pegah Kamousi, Fangqiu Han, Shengqi Yang, Xifeng Yan, Subhash Suri University of California, Santa Barbara {yangli, pegah, fhan, sqyang, xyan, suri}@cs.ucsb.edu A DocID: 1rl2X - View Document
	1 Exemplar Longest Common Subsequence Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin , Raffaella Rizzi and St´ephane Vialette DocID: 1qY8g - View Document
	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 DocID: 1qXlh - View Document
	The Uncertainty of Identity Toolset: Analysing Digital Traces for User Profiling Muhammad Adnan Antonio Lima DocID: 1qJrI - View Document
	CSE 181 Project guidelines DocID: 1qDcO - View Document