Results 1  10
of
680,408
On Maximal Repeats in Strings
"... We clarify in this paper the relationship between the maximal repeats in a string p and the compact suffix automaton CSA(p) built on p. It appears that the maximal repeats are the longest strings reaching each internal state of the CSA(p). This result permits to derive the maximal and the average nu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We clarify in this paper the relationship between the maximal repeats in a string p and the compact suffix automaton CSA(p) built on p. It appears that the maximal repeats are the longest strings reaching each internal state of the CSA(p). This result permits to derive the maximal and the average
Finding Maximal repeats with . . .
"... Factor oracles, built from an input text, are automata similar to suffix automata, and accepting at least all substrings of the input text. In papers [LL00] and [LLA02], factor oracles are used to detect repeats on text. Although repeats found with these methods are not maximal, average error is ver ..."
Abstract
 Add to MetaCart
Factor oracles, built from an input text, are automata similar to suffix automata, and accepting at least all substrings of the input text. In papers [LL00] and [LLA02], factor oracles are used to detect repeats on text. Although repeats found with these methods are not maximal, average error
REPuter: fast computation of maximal repeats in complete genomes
, 1995
"... Summary: A software tool was implemented that computes exact repeats and palindromes in entire genomes very efficiently. Availability: Via the Bielefeld Bioinformatics Server (http://bibiserv.techfak.unibielefeld.de/reputer/). ..."
Abstract

Cited by 146 (3 self)
 Add to MetaCart
Summary: A software tool was implemented that computes exact repeats and palindromes in entire genomes very efficiently. Availability: Via the Bielefeld Bioinformatics Server (http://bibiserv.techfak.unibielefeld.de/reputer/).
Fitting a mixture model by expectation maximization to discover motifs in biopolymers.
 Proc Int Conf Intell Syst Mol Biol
, 1994
"... Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a twocomponent finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model to th ..."
Abstract

Cited by 946 (5 self)
 Add to MetaCart
to the data, probabilistically erasing tile occurrences of the motif thus found, and repeating the process to find successive motifs. The algorithm requires only a set of unaligned sequences and a number specifying the width of the motifs as input. It returns a model of each motif and a threshold which
A note on maximally repeated subpatterns of a point set
"... We answer a question raised by P. Brass on the number of maximally repeated subpatterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial, is in fact Θ(2n/2) in the worst case, regardless of the dimension d. Key words: Discrete geometry, point sets, repeat ..."
Abstract
 Add to MetaCart
We answer a question raised by P. Brass on the number of maximally repeated subpatterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial, is in fact Θ(2n/2) in the worst case, regardless of the dimension d. Key words: Discrete geometry, point sets
Online Construction of compact suffix vectors and maximal repeats ∗
"... A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear construction algorithm of an extended suffix vector then another linear algorithm to transform an extended suffix vector into a ..."
Abstract
 Add to MetaCart
of the extended suffix vector. Finally, we present an efficient method for computing maximal repeats using suffix vectors. 1
Those who understand: Knowledge growth in teaching. Educational Researcher
, 1986
"... "He who can, does. He who cannot, teaches. “ 1 don't know in what fit of pique George Bernard Shaw wrote that infamous aphorism, words that have plagued members of the teaching profession for nearly a century. They are found in "Maxims for Revolutionists, " an appendix to his pl ..."
Abstract

Cited by 1363 (1 self)
 Add to MetaCart
"He who can, does. He who cannot, teaches. “ 1 don't know in what fit of pique George Bernard Shaw wrote that infamous aphorism, words that have plagued members of the teaching profession for nearly a century. They are found in "Maxims for Revolutionists, " an appendix to his
The Nonstochastic Multiarmed Bandit Problem
 SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying out ..."
Abstract

Cited by 490 (34 self)
 Add to MetaCart
In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying
Time and spaceefficient maximal repeat finding using the BurrowsWheeler transform and wavelet trees
 In the Proceedings of IEEE International Conference on Bioinformatics and Biomedicine (BIBM
, 2010
"... Abstract—Finding repetitive structures in genomes is important to understand their biological functions. Many modern genomic sequence data compressors also highly rely on finding the repeats over the sequences. The notion of maximal repeats captures all the repeats in a spaceefficient way. Prior w ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract—Finding repetitive structures in genomes is important to understand their biological functions. Many modern genomic sequence data compressors also highly rely on finding the repeats over the sequences. The notion of maximal repeats captures all the repeats in a spaceefficient way. Prior
Indexing based on scale invariant interest points
 In Proceedings of the 8th International Conference on Computer Vision
, 2001
"... This paper presents a new method for detecting scale invariant interest points. The method is based on two recent results on scale space: 1) Interest points can be adapted to scale and give repeatable results (geometrically stable). 2) Local extrema over scale of normalized derivatives indicate the ..."
Abstract

Cited by 408 (32 self)
 Add to MetaCart
This paper presents a new method for detecting scale invariant interest points. The method is based on two recent results on scale space: 1) Interest points can be adapted to scale and give repeatable results (geometrically stable). 2) Local extrema over scale of normalized derivatives indicate
Results 1  10
of
680,408