Reasoning About Approximate Match Query Results

2006 ◽  
Author(s):  
S. Guha ◽  
N. Koudas ◽  
D. Srivastava ◽  
Xiaohui Yu
Keyword(s):  
Approximate Match

A New Approach to String Pattern Mining with Approximate Match

2013 ◽  
pp. 110-125 ◽  
Author(s):  
Tetsushi Matsui ◽  
Takeaki Uno ◽  
Juzoh Umemori ◽  
Tsuyoshi Koide
Keyword(s):  
Pattern Mining ◽  
New Approach ◽  
Approximate Match ◽  
String Pattern

scholarly journals Short Read Alignment Based on Maximal Approximate Match Seeds

2020 ◽  
Vol 7 ◽  
Author(s):  
Wei Quan ◽  
Dengfeng Guan ◽  
Guangri Quan ◽  
Bo Liu ◽  
Yadong Wang
Keyword(s):  
Short Read ◽  
Read Alignment ◽  
Approximate Match ◽  
Short Read Alignment

Merging the Results of Approximate Match Operations

2004 ◽  
pp. 636-647 ◽  
Author(s):  
Sudipto Guha ◽  
Nick Koudas ◽  
Amit Marathe ◽  
Divesh Srivastava
Keyword(s):  
Approximate Match

Counterfactuals and Closeness

2020 ◽  
pp. 75-107
Author(s):  
Paul Noordhof
Keyword(s):  
Perfect Match ◽  
Approximate Match ◽  
Precise Understanding

The semantics for counterfactuals builds on Lewis’ theory and similarity weighting, with two principal aims. The first of these is to resist those who argue that appeal to counterfactuals in the analysis of causation is circular because their semantics must appeal to causal facts (specifically, in the similarity weighting for worlds). The second of these is to secure the semantics for counterfactuals for a possible account of causal non-symmetry in terms of counterfactual non-symmetry. As a result, weight is rightly placed upon perfect match as an important aspect of similarity although this is moderated to deal an indeterministic version of Fine’s Future Similarity Objection. A more precise understanding of the role of approximate match is developed appealing to a type of probabilistic independence.

Almost-sure waiting time results for weak and very weak Bernoulli processes

1995 ◽  
Vol 15 (5) ◽  
pp. 951-960 ◽  
Author(s):  
Katalin Marton ◽  
Paul C. Shields
Keyword(s):  
Waiting Time ◽  
Initial Segment ◽  
Sample Path ◽  
Almost Sure Convergence ◽  
Approximate Match ◽  
Joint Distributions ◽  
Blowing Up ◽  
Bernoulli Processes

AbstractAlmost-sure convergence of (l/k) log Wk(x, y) to entropy for weak Bernoulli processes is proved, where Wk (x, y) is the waiting time until an initial segment of length k of a sample path x is seen in an independently chosen sample path y. Analogous almost-sure results are obtained in the approximate match case for very weak Bernoulli processes. The weak Bernoulli proof uses recent results obtained by the authors about the estimation of joint distributions, while the very weak Bernoulli result utilizes a new characterization of such processes in terms of a blowing-up property.

Sign in / Sign up

Export Citation Format

Share Document