-
1
-
-
84976791819
-
Bounds on the complexity of the longest common subsequence problem
-
Aho AV, Hirschberg DS and Ullman JD (1976). Bounds on the complexity of the longest common subsequence problem. J ACM 23(1):1-12
-
(1976)
J ACM
, vol.23
, Issue.1
, pp. 1-12
-
-
Aho, A.V.1
Hirschberg, D.S.2
Ullman, J.D.3
-
2
-
-
1442263887
-
Faster algorithms for string matching with k mismatches
-
Lewenstein AM and Porat E (2004). Faster algorithms for string matching with k mismatches. J Algorithms 50:257-275
-
(2004)
J Algorithms
, vol.50
, pp. 257-275
-
-
Lewenstein, A.M.1
Porat, E.2
-
3
-
-
51049084942
-
String editing and longest common subsequences
-
Apostolico In: Rozenberg G, Salomaa A (eds). Springer, Heidelberg
-
Apostolico (1996) String editing and longest common subsequences. In: Rozenberg G, Salomaa A (eds). Vol II of Handbook of Formal Languages. Springer, Heidelberg
-
(1996)
Vol II of Handbook of Formal Languages
-
-
-
4
-
-
0034188142
-
Keeping up with the changing web
-
Brewington B and Cybenko G (2000). Keeping up with the changing web. IEEE Comput 33(5):52-58
-
(2000)
IEEE Comput
, vol.33
, Issue.5
, pp. 52-58
-
-
Brewington, B.1
Cybenko, G.2
-
5
-
-
33750560216
-
Efficient string matching with wildcards and length constraints
-
Chen G, Wu X, Zhu X, Arslan AN and He Y (2006). Efficient string matching with wildcards and length constraints. Knowl Inf Syst 10(4):399-419
-
(2006)
Knowl Inf Syst
, vol.10
, Issue.4
, pp. 399-419
-
-
Chen, G.1
Wu, X.2
Zhu, X.3
Arslan, A.N.4
He, Y.5
-
7
-
-
0002698813
-
On the resemblance and containment of documents. Compression and complexity of sequences(SEQUENCES'97)
-
Broder
-
Broder (1997) On the resemblance and containment of documents. Compression and complexity of sequences(SEQUENCES'97), IEEE Computer Society pp 21-29
-
(1997)
IEEE Computer Society
, pp. 21-29
-
-
-
8
-
-
51049116277
-
-
DBWORLD [Online; accessed 04-30-2007]
-
DBWORLD (2007) DBWorld, http://www.cs.wisc.edu/dbworld/ [Online; accessed 04-30-2007]
-
(2007)
DBWorld
-
-
-
9
-
-
84989525001
-
Indexing by Latent Semantic Analysis
-
Deerwester S, Dumais ST, Furnas GW, Landauer TK and Harshman R (1990). Indexing by Latent Semantic Analysis. J Am Soc Inf Sci 41:391-407
-
(1990)
J Am Soc Inf Sci
, vol.41
, pp. 391-407
-
-
Deerwester, S.1
Dumais, S.T.2
Furnas, G.W.3
Landauer, T.K.4
Harshman, R.5
-
10
-
-
0742306577
-
Improving the retrieval of information from external resources
-
Dumais ST (1991). Improving the retrieval of information from external resources. Behav Res Methods Instr Comput 23:229-236
-
(1991)
Behav Res Methods Instr Comput
, vol.23
, pp. 229-236
-
-
Dumais, S.T.1
-
11
-
-
85132115014
-
Document similarity using a phrase indexing graph model
-
Hammouda KM and Kamel MS (2004). Document similarity using a phrase indexing graph model. Knowl Inf Syst 6(6):710-727
-
(2004)
Knowl Inf Syst
, vol.6
, Issue.6
, pp. 710-727
-
-
Hammouda, K.M.1
Kamel, M.S.2
-
12
-
-
84976825385
-
Algorithms for the longest common subsequence problem
-
Hirschberg DS (1977). Algorithms for the longest common subsequence problem. J ACM 24(4):664-675
-
(1977)
J ACM
, vol.24
, Issue.4
, pp. 664-675
-
-
Hirschberg, D.S.1
-
14
-
-
28044431810
-
Web data extraction based on structural similarity
-
Li Z, Ng WK and Sun A (2005). Web data extraction based on structural similarity. Knowl Inf Syst 8(4):438-461
-
(2005)
Knowl Inf Syst
, vol.8
, Issue.4
, pp. 438-461
-
-
Li, Z.1
Ng, W.K.2
Sun, A.3
-
17
-
-
0037880329
-
-
HP technical report, HPL-2002-57
-
Milojicic DS, Kalogeraki V, Lukose R, Nagarajal K, Pruyne J, Richard B, Rollis S, Xu Z (2002) Peer-to-peer computing. HP technical report, HPL-2002-57
-
(2002)
Peer-to-peer Computing
-
-
Milojicic, D.S.1
Kalogeraki, V.2
Lukose, R.3
Nagarajal, K.4
Pruyne, J.5
Richard, B.6
Rollis, S.7
Xu, Z.8
-
18
-
-
0020205756
-
A longest common subsequence algorithm suitable for similar text strings
-
Nakatsu N, Kambayashi Y and Yajima S (1982). A longest common subsequence algorithm suitable for similar text strings. Acta Info 18:171-179
-
(1982)
Acta Info
, vol.18
, pp. 171-179
-
-
Nakatsu, N.1
Kambayashi, Y.2
Yajima, S.3
-
19
-
-
0345566149
-
A guided tour to approximate string matching
-
Navarro G (2001). A guided tour to approximate string matching. ACM Comput Surv 33(1):31-88
-
(2001)
ACM Comput Surv
, vol.33
, Issue.1
, pp. 31-88
-
-
Navarro, G.1
-
20
-
-
0003602325
-
The MD5 message-digest algorithm
-
RFC1321
-
Rivest R (1992) The MD5 message-digest algorithm. RFC1321
-
(1992)
-
-
Rivest, R.1
-
24
-
-
0004011076
-
Efficient algorithms for sorting and synchronization
-
PhD Thesis, Australian National University
-
Trigdell A (2000) Efficient algorithms for sorting and synchronization. PhD Thesis, Australian National University
-
(2000)
-
-
Trigdell, A.1
-
25
-
-
0003570191
-
-
Technical Report TR-CS-96-05, Australian National University
-
Trigdell A, Mackerras P (1996) The rsync algorithm. Technical Report TR-CS-96-05, Australian National University
-
(1996)
The Rsync Algorithm
-
-
Trigdell, A.1
Mackerras, P.2
-
27
-
-
51049086458
-
-
Wikimedia Diff [Online; accessed 04-30-2007]
-
Wikimedia Diff (2007) Wikimedia, Meta-Wiki. http://meta.wikimedia.org/ wiki/Diff, [Online; accessed 04-30-2007]
-
(2007)
Wikimedia, Meta-Wiki
-
-
-
28
-
-
39049132401
-
-
Wikipedia [Online; accessed 04-30-2007]
-
Wikipedia (2007) The Free Encyclopedia. http://en.wikipedia.org [Online; accessed 04-30-2007]
-
(2007)
The Free Encyclopedia
-
-
|