메뉴 건너뛰기




Volumn 9, Issue 1, 2011, Pages 67-81

Pattern matching in pseudo real-time

Author keywords

Approximate pattern matching; Distance function; Online algorithm

Indexed keywords

APPROXIMATE MATCHING; APPROXIMATE PATTERN MATCHING; DISTANCE FUNCTION; DISTANCE FUNCTIONS; LOG FACTORS; MATCHING PROBLEMS; NEW SOLUTIONS; NONLOCAL; OFFLINE; ON-LINE ALGORITHMS; RUNNING TIME; SUBSTRING; WORST CASE;

EID: 79551606012     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2010.09.005     Document Type: Conference Paper
Times cited : (8)

References (16)
  • 4
    • 33646424680 scopus 로고    scopus 로고
    • Swap and mismatch edit distance
    • Amihood Amir, Estrella Eisenberg, and Ely Porat Swap and mismatch edit distance Algorithmica 45 1 2006 109 120
    • (2006) Algorithmica , vol.45 , Issue.1 , pp. 109-120
    • Amir, A.1    Eisenberg, E.2    Porat, E.3
  • 5
    • 0028381833 scopus 로고
    • Alphabet dependence in parameterized matching
    • Amihood Amir, Martin Farach, and S. Muthukrishnan Alphabet dependence in parameterized matching Inf. Process. Lett. 49 3 1994 111 115
    • (1994) Inf. Process. Lett. , vol.49 , Issue.3 , pp. 111-115
    • Amir, A.1    Farach, M.2    Muthukrishnan, S.3
  • 6
    • 37849014961 scopus 로고    scopus 로고
    • Self-normalised distance with don't cares
    • Peter Clifford, Raphaël Clifford, Self-normalised distance with don't cares, in: CPM '07, 2007, pp. 63-70.
    • (2007) CPM '07 , pp. 63-70
    • Peter Clifford, R.1
  • 7
    • 45849089972 scopus 로고    scopus 로고
    • A black box for online approximate pattern matching
    • Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, A black box for online approximate pattern matching, in: CPM '08, 2008, pp. 143-151.
    • (2008) CPM '08 , pp. 143-151
    • Raphaël Clifford, K.1
  • 8
    • 84968754816 scopus 로고    scopus 로고
    • A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
    • Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson, A sub-quadratic sequence alignment algorithm for unrestricted cost matrices, in: SODA '02, 2002, pp. 679-688.
    • (2002) SODA '02 , pp. 679-688
    • Crochemore, M.1    Landau, G.M.2    Ziv-Ukelson, M.3
  • 9
    • 0015773011 scopus 로고
    • Fast on-line integer multiplication
    • ACM New York, NY, USA
    • Michael J. Fischer, and Larry J. Stockmeyer Fast on-line integer multiplication STOC '73 1973 ACM New York, NY, USA 67 72
    • (1973) STOC '73 , pp. 67-72
    • Fischer, M.J.1    Stockmeyer, L.J.2
  • 10
    • 84976813841 scopus 로고
    • String matching in real time
    • Zvi Galil String matching in real time J. ACM 28 1 1981 134 149
    • (1981) J. ACM , vol.28 , Issue.1 , pp. 134-149
    • Galil, Z.1
  • 13
    • 0002193989 scopus 로고
    • Fast string matching with k differences
    • Gad M. Landau, and Uzi Vishkin Fast string matching with k differences J. Comput. Syst. Sci. 37 1 1988 63 78
    • (1988) J. Comput. Syst. Sci. , vol.37 , Issue.1 , pp. 63-78
    • Landau, G.M.1    Vishkin, U.2
  • 14
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V. Levenshtein Binary codes capable of correcting deletions, insertions, and reversals Soviet Phys. Dokl. 10 8 1966
    • (1966) Soviet Phys. Dokl. , vol.10 , Issue.8
    • Levenshtein, V.1
  • 15
    • 85028161017 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • Udi Manber, Gene Myers, Suffix arrays: a new method for on-line string searches, in: SODA '90, 1990, pp. 319-327.
    • (1990) SODA '90 , pp. 319-327
    • Manber, U.1    Myers, G.2
  • 16
    • 0020494998 scopus 로고
    • Algorithms for approximate string matching
    • Esko Ukkonen Algorithms for approximate string matching Inf. Control 64 1-3 1985 100 118
    • (1985) Inf. Control , vol.64 , Issue.13 , pp. 100-118
    • Ukkonen, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.