Results 1  10
of
1,262,725
Approximate Matching of Hierarchical Data
 PHD DISSERTATION
, 2008
"... All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the The goal of this thesis is to design, develop, and ..."
Abstract
 Add to MetaCart
, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard as in addition to the data values also the structure must
Approximate Matching in the L ∞ Metric
"... Abstract. Let a text T = t0,..., tn−1 and a pattern P = p0,..., pm−1, strings of natural numbers, be given. In the Approximate Matching in the L ∞ metric problem the output is, for every text location i, the L∞ distance between the pattern and the length m substring of the text starting at i, i.e. M ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Let a text T = t0,..., tn−1 and a pattern P = p0,..., pm−1, strings of natural numbers, be given. In the Approximate Matching in the L ∞ metric problem the output is, for every text location i, the L∞ distance between the pattern and the length m substring of the text starting at i, i
Compression and Approximate Matching
 The Computer Journal
, 1999
"... A population of sequences is called nonrandom if there is a statistical model and an associated compression algorithm that allows members of the population to be compressed, on average. Any available statistical model of a population should be incorporated into algorithms for alignment of the seque ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
of the sequences and doing so changes the rank order of possible alignments in general. The model should also be used in deciding if a resulting approximate match between two sequences is significant or not. It is shown how to do this for two plausible interpretations involving pairs of sequences that might
Approximate Matching of Secondary Structures
, 2001
"... Several methods have been developed for identifying more or less complex RNA structures in a genome. Whatever the method is, it is always based on the search of conserved primary and secondary structures. While various efficient methods have been developed for searching motifs of the primary structu ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
approximate matches of a helix in a genome. Helices are represented by special regular expressions, that we call secondary expressions. The method is based on an alignment graph constructed from several copies of a pushdown automaton, arranged one on top of another. The worst time complexity is O(rpn), where
Distributed approximate matching
, 2007
"... We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + ɛ)approximation distributed algorithm for weighted maximum matching, whose running time is O(log n) for any constant ɛ> 0, where n is the number of nodes in the graph. In a ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
We consider distributed algorithms for approximate maximum matching on general graphs. Our main result is a randomized (4 + ɛ)approximation distributed algorithm for weighted maximum matching, whose running time is O(log n) for any constant ɛ> 0, where n is the number of nodes in the graph
Improved Distributed Approximate Matching
"... We present improved algorithms for finding approximately optimal matchings in both weighted and unweighted graphs. For unweighted graphs, we give an algorithm providing (1 − ɛ)approximation in O(log n) time for any constant ɛ> 0. This result improves on the classical 1approximation due 2 to Isr ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
We present improved algorithms for finding approximately optimal matchings in both weighted and unweighted graphs. For unweighted graphs, we give an algorithm providing (1 − ɛ)approximation in O(log n) time for any constant ɛ> 0. This result improves on the classical 1approximation due 2
Approximate Matching of Network Expressions with Spacers
 Journal of Computational Biology
, 1992
"... Two algorithmic results are presented that are pertinent to the matching of patterns of interest in macromolecular sequences. The first result is an output sensitive algorithm for approximately matching network expressions, i.e., regular expressions without Kleene closure. This result generalizes th ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
Two algorithmic results are presented that are pertinent to the matching of patterns of interest in macromolecular sequences. The first result is an output sensitive algorithm for approximately matching network expressions, i.e., regular expressions without Kleene closure. This result generalizes
Approximating matches made in heaven
 In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, LNCS 5555
, 2009
"... Abstract. Motivated by applications in online dating and kidney exchange, we study a stochastic matching problem in which we have a random graph G given by a node set V and probabilities p(i, j) on all pairs i, j ∈ V representing the probability that edge (i, j) exists. Additionally, each node has a ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Abstract. Motivated by applications in online dating and kidney exchange, we study a stochastic matching problem in which we have a random graph G given by a node set V and probabilities p(i, j) on all pairs i, j ∈ V representing the probability that edge (i, j) exists. Additionally, each node has
Finding Approximate Matches in Large Lexicons
 SOFTWARE  PRACTICE AND EXPERIENCE
, 1995
"... Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including ngrams and p ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n
Search for Approximate Matches in Large Databases
 In Proc. of the 2004 IEEE Intl. Conf. on Systems, Man, and Cybernetics
"... Abstract – We present a system for indexing large sets of records, and retrieving exact and approximate matches for a given query. We define records, queries, and matches between them, describe an indexing structure for fast identification of exact and approximate matches, and give results of testin ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract – We present a system for indexing large sets of records, and retrieving exact and approximate matches for a given query. We define records, queries, and matches between them, describe an indexing structure for fast identification of exact and approximate matches, and give results
Results 1  10
of
1,262,725