Dynamic partitioning of search patterns for approximate pattern matching using search schemes
نویسندگان
چکیده
منابع مشابه
FAMOUS: Fast Approximate string Matching using OptimUm search Schemes
Finding approximate occurrences of a pattern in a text using a full-text index is a central problem in bioinformatics and has been extensively researched. The introduction of practical bidirectional indices has opened new possibilities for solving the problem as they allow the search to be started from anywhere within the pattern and extended in both directions. In particular, use of search sch...
متن کاملApproxSeek: Web Document Search Using Approximate Matching
Conventional search engines nd Web pages by using keyword matching. Two disadvantages for keyword matching are: (i) the order of keywords is ignored; and (ii) the approximate queries submitted by users are beyond the method of keyword matching can handle. Using keyword matching for Web page search is not satisfactory. This paper proposes a Web search system, named ApproxSeek, to facilitate Web ...
متن کاملDistributed Search and Pattern Matching
Peer-to-peer (P2P) technology has triggered a wide range of distributed applications including file-sharing, distributed XML databases, distributed computing, server-less web publishing and networked resource/service sharing. Despite of the diversity in application, these systems share common requirements for searching due to transitory nodes population and content volatility. In such dynamic e...
متن کاملAge Matching Patterns and Search
This paper considers a marriage market with two-sided search and transferable utility in which the match payoff depends on age. It characterizes a set of payoff functions consistent with two salient marriage age patterns, (1) assortative matching by age, and (2) “differential age matching”, a formalization of the age difference at marriage between men and women. Some simple conditions on slope ...
متن کاملDynamic and Approximate Pattern Matching in 2D
We consider dynamic and online variants of 2D pattern matching between an m×m pattern and an n× n text. All the algorithms we give are randomised and give correct outputs with at least constant probability. – For dynamic 2D exact matching where updates change individual symbols in the text, we show updates can be performed in O(log n) time and queries in O(log m) time. – We then consider a mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: iScience
سال: 2021
ISSN: 2589-0042
DOI: 10.1016/j.isci.2021.102687