Results 1  10
of
673,121
Faster Approximate String Matching
 Algorithmica
, 1999
"... We present a new algorithm for online approximate string matching. The algorithm is based on the simulation of a nondeterministic finite automaton built from the pattern and using the text as input. This simulation uses bit operations on a RAM machine with word length w = \Omega\Gamma137 n) bits, ..."
Abstract

Cited by 79 (23 self)
 Add to MetaCart
We present a new algorithm for online approximate string matching. The algorithm is based on the simulation of a nondeterministic finite automaton built from the pattern and using the text as input. This simulation uses bit operations on a RAM machine with word length w = \Omega\Gamma137 n) bits
Faster approximation of distances in graphs
 IN PROC. WADS
, 2007
"... Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating allpairs shortest paths in G. Our first algorithm runs in Õ(n2) time, and for any u, v ∈ V reports distance no greater th ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating allpairs shortest paths in G. Our first algorithm runs in Õ(n2) time, and for any u, v ∈ V reports distance no greater
Faster Approximate String Matching over Compressed Text
 In Proc. 11th IEEE Data Compression Conference (DCC'01
"... Approximate string matching on compressed text was a problem open during almost a decade. The two existing solutions are very recent. Despite that they represent important complexity breakthroughs, in most practical cases they are not useful, in the sense that they are slower than uncompressing t ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
Approximate string matching on compressed text was a problem open during almost a decade. The two existing solutions are very recent. Despite that they represent important complexity breakthroughs, in most practical cases they are not useful, in the sense that they are slower than uncompressing
Faster Approximation Schemes for Fractional Multicommodity Flow Problems
"... We present fully polynomial approximation schemes for concurrent multicommodity flow problems that run in time of minimum possible dependency on the number of commodities k. We showthat by modifying the algorithms by Garg & K"onemann [7] and Fleischer [5] we can reduce their running ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
We present fully polynomial approximation schemes for concurrent multicommodity flow problems that run in time of minimum possible dependency on the number of commodities k. We showthat by modifying the algorithms by Garg & K"onemann [7] and Fleischer [5] we can reduce their running
Faster Approximation Algorithms for the Minimum Latency Problem
 In Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2003. [BCC + 94
, 2003
"... In this paper, we give a 9.28approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prizecollecting Steiner tree (PCST) subroutine of Goemans and Williamson. A previous algorithm of Goemans and Kleinberg for the minimum latency problem requires an approximat ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
and Karakostas). In order to match our approximation ratio (i.e. setting # = 2.10), the latter version requires n) PCST calls, so our running time bound is faster by a factor of #(n log n). Since PCST can be implemented to run in O(n ) time, the overall running time of our algorithm is O(n log n).
Faster approximate pattern matching in compressed repetitive texts
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC
, 2011
"... Motivated by the imminent growth of massive, highly redundant genomic databases we study the problem of compressing a string database while simultaneously supporting fast random access, substring extraction and pattern matching to the underlying string(s). Bille et al. (2011) recently showed how, gi ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
all occ approximate matches to p in s in O(r(min(mk, k4 + m) + log n) + occ) time. Rytter (2003) and Charikar et al. (2005) showed that r is always at least the number z of phrases in the LZ77 parse of s, and gave algorithms for building straightline programs with O(z log n) rules. In this paper we
Labeled Markov processes: stronger and faster approximations
, 2004
"... This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former constructions [11,12] in the sense that they define approximants that capture more properties than before and that conve ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
and that converge faster to the approximated process. One scheme is constructive and the two others are driven by properties on which one wants to focus. All three constructions involve quotienting the statespace in some way and the last two are quotients with respect to sets of temporal properties expressed in a
Faster Approximation Algorithms for Scheduling with Fixed Jobs
"... We study the problem of scheduling jobs on identical parallel machines without preemption. In the considered setting, some of the jobs are already assigned machines and starting times, for example due to external constraints not explicitly modelled. The objective is to assign the rest of the jobs in ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
algorithm with approximation ratio 3/2 and polynomial running time. We also give matching results for the related problem of scheduling with reservations. The new algorithm is both faster and conceptually simpler than the previously known algorithms. 1
Optimal spaced seeds for faster approximate string matching
"... Filtering is a standard technique for fast approximate string matching in practice. In fi#12;ltering, a quick #12;first step is used to rule out almost all positions of a text as possible starting positions for a pattern. Typically this step consists of fi#12;nding the exact matches of small parts o ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Filtering is a standard technique for fast approximate string matching in practice. In fi#12;ltering, a quick #12;first step is used to rule out almost all positions of a text as possible starting positions for a pattern. Typically this step consists of fi#12;nding the exact matches of small parts
Results 1  10
of
673,121