-
1
-
-
33244468606
-
Pattern matching with address errors: Rearrangement distances
-
SODA
-
Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. In: Proc. 17th ACM-SIAM Symp. on Discrete Algorithms (SODA) (2006)
-
(2006)
Proc. 17th ACM-SIAM Symp. on Discrete Algorithms
-
-
Amir, A.1
Aumann, Y.2
Benson, G.3
Levy, A.4
Lipsky, O.5
Porat, E.6
Skiena, S.7
Vishne, U.8
-
2
-
-
0037465502
-
Overlap matching
-
Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Information and Computation 181(1), 57-74 (2003)
-
(2003)
Information and Computation
, vol.181
, Issue.1
, pp. 57-74
-
-
Amir, A.1
Cole, R.2
Hariharan, R.3
Lewenstein, M.4
Porat, E.5
-
3
-
-
0037118752
-
Approximate swapped matching
-
Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Information Processing Letters 83(1), 33-39 (2002)
-
(2002)
Information Processing Letters
, vol.83
, Issue.1
, pp. 33-39
-
-
Amir, A.1
Lewenstein, M.2
Porat, E.3
-
5
-
-
84957634698
-
-
Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, 1075, pp. 168-185. Springer, Heidelberg (1996)
-
Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 168-185. Springer, Heidelberg (1996)
-
-
-
-
10
-
-
84976712224
-
Rapid identification of repeated patterns in strings, arrays and trees
-
Karp, R., Miller, R., Rosenberg, A.: Rapid identification of repeated patterns in strings, arrays and trees. In: Symposium on the Theory of Computing, vol. 4, pp. 125-136 (1972)
-
(1972)
Symposium on the Theory of Computing
, vol.4
, pp. 125-136
-
-
Karp, R.1
Miller, R.2
Rosenberg, A.3
-
11
-
-
0016494974
-
An extension of the string-to-string correction problem
-
Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. of the ACM, 177-183 (1975)
-
(1975)
J. of the ACM
, vol.177-183
-
-
Lowrance, R.1
Wagner, R.A.2
-
13
-
-
84976779342
-
Fast probabilistic algorithms for verification of polynomial identities
-
Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. of the ACM 27, 701-717 (1980)
-
(1980)
J. of the ACM
, vol.27
, pp. 701-717
-
-
Schwartz, J.T.1
-
14
-
-
84925463455
-
Probabilistic algorithms for sparse polynomials
-
Ng, K.W, ed, EUROSAM 1979 and ISSAC 1979, Springer, Heidelberg
-
Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 216-226. Springer, Heidelberg (1979)
-
(1979)
LNCS
, vol.72
, pp. 216-226
-
-
Zippel, R.1
|