| Document Date: 2008-11-06 21:42:34
Open Document File Size: 124,88 KBShare Result on Facebook
City Fontainebleau / Berlin / St. Petersburg / Paris / / Country France / Russia / / Currency pence / / / Facility Steklov Institute of Mathematics / terminal Xi / / IndustryTerm polynomial algorithm / universal algorithm / binary search / subsequence search problems / compression algorithms / naive decompress-then-search approach / program computing / / Movie From now on / / OperatingSystem Xp / Microsoft Windows / / Organization Steklov Institute of Mathematics / Computer Science Department / / Product ZTE C88 Cellular Phone / / PublishedMedium IEEE Transactions on Information Theory / / Technology 4.3 Final algorithm / 2.2 Lempel-Ziv-Welch algorithm / 2.3 Lempel-Ziv algorithm / compression algorithms / Data Mining / 2 2.1 Compression algorithms / using Lempel-Ziv-like compression algorithms / polynomial algorithm / / URL http /
SocialTag |
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