Compressed suffix array - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2003-12-11 16:41:32 Pattern matching String matching algorithms Suffix tree Trie Suffix array Compressed pattern matching String searching algorithm Boyer–Moore string search algorithm Lempel–Ziv–Welch String Computing Computer programming		Add to Reading List Source URL: vlsi.cs.ucf.edu Download Document from Source Website File Size: 303,75 KB Share Document on Facebook

	Small-Space 2D Compressed Dictionary Matching DocID: 15Ltp - View Document
	Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda Department of Informatics, Kyushu University, JAPAN DocID: 15Hhh - View Document
	Processing Compressed Texts: A Tractability Border Yury Lifshits Steklov Institute of Mathematics at St.Petersburg http://logic.pdmi.ras.ru/~yura DocID: 14oQZ - View Document
	Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts Philip Bille IT University of Copenhagen Rolf Fagerberg DocID: 124GO - View Document
	Window subsequence problems for compressed texts? Patrick C´egielski1, Ir`ene Guessarian2 , Yury Lifshits3 , Yuri Matiyasevich3 1 LACL, UMR-FRE 2673, Universit´e Paris 12, Route foresti`ere Hurtault, F-77300 DocID: 119jI - View Document