LNCS 2748 Dynamic Text and Static Pattern Matching 1st Edition by Amihood Amir, Gad Landau, Moshe Lewenstein, Dina Sokol ISBN 3540450785 9783540450788

LNCS 2748 – Dynamic Text and Static Pattern Matching 1st Edition by Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol – Ebook PDF Instant Download/Delivery. 3540450785, 9783540450788

Full download LNCS 2748 – Dynamic Text and Static Pattern Matching 1st Edition after payment

 

 

Product details:

ISBN 10: 3540450785

ISBN 13: 9783540450788

Author:  Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol 

LNCS 2748 – Dynamic Text and Static Pattern Matching 1st Edition: In this paper, we address a new version of dynamic pattern matching. The dynamic text and static pattern matching problem is the problem of finding a static pattern in a text that is continuously being updated. The goal is to report all new occurrences of the pattern in the text after each text update. We present an algorithm for solving the problem, where the text update operation is changing the symbol value of a text location. Given a text of length n and a pattern of length m, our algorithm preprocesses the text in time O(nlog logm), and the pattern in time <span id="MathJax-Element-1-Frame" class="MathJax_SVG" style="box-sizing: inherit; display: inline-block; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; font-size-adjust: none; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;" tabindex="0" role="presentation" data-mathml="O(mlogm)”>O(mlogm). The extra space used is <span id="MathJax-Element-2-Frame" class="MathJax_SVG" style="box-sizing: inherit; display: inline-block; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; font-size-adjust: none; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;" tabindex="0" role="presentation" data-mathml="O(n+mlogm)”>O(n+mlogm). Following each text update, the algorithm deletes all prior occurrences of the pattern that no longer match, and reports all new occurrences of the pattern in the text in O(log log m) time.

 

LNCS 2748 – Dynamic Text and Static Pattern Matching 1st Edition Table of contents:

1 Introduction

2 Main Idea

3 Preliminaries

4 The Algorithm

5 Find New Matches

6 Data Structures for the Pattern

7 Summary

8 Open Problems

 

People also search for LNCS 2748 – Dynamic Text and Static Pattern Matching 1st Edition:

dynamic text
    
matching dynamic markings 2 answers
    
matching dynamic markings
    
matching dynamic markings 2
    
matching dynamic markings 1 answers
    
c dynamic string