×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [length n]
Home >
length n
1 Approximate String Matching Using Compressed Suffix Arrays Trinh N. D. Huynh, W. K. Hon, T. W. Lam and W. K. Sung, Theoretical Computer Science, Vol.
216 views
1 Faster algorithms for string matching with k mismatches Adviser : R. C. T. Lee Speaker: C. C. Yen Journal of Algorithms, Volume 50, Issue 2, February.
216 views
Routing in Poisson small-world networks A. J. Ganesh Microsoft Research, Cambridge Joint work with Moez Draief.
215 views
Computational Complexity Dr. Colin Campbell Course: EMAT20531.
232 views
Tuned Boyer Moore Algorithm Fast string searching, HUME A. and SUNDAY D.M., Software - Practice & Experience 21(11), 1991, pp. 1221-1248. Adviser: R. C.
227 views
Tight Bounds for Online Class- constrained Packing Hadas Shachnai Bell Labs and The Technion IIT Tami Tamir The Technion IIT.
216 views
Mathematics Involving Shape and Space a Algebra. The 9-Dot Problem.
224 views
Http://cindy1 Efficient Probe Selection in Micro-array Design Speaker: Cindy Y. Li Joint work with: Leszek G ą sieniec, Paul Sant, and.
213 views
10/12/20141LCS. Given two strings S 1 of length m and S 2 of length n over the same alphabeth. The Longest Common Substring problem is to find the longest.
214 views
Approximate List- Decoding and Hardness Amplification Valentine Kabanets (SFU) joint work with Russell Impagliazzo and Ragesh Jaiswal (UCSD)
212 views
11 - Programming languages
797 views
Ch10
1.364 views
< Previous
Next >