DOIAbstract
Didier G, Schmidt T, Stoye J, Tsur D. Character Sets of Strings. Journal of Discrete Algorithms. 2007;5(2):330-340
Didier G, Schmidt T, Stoye J, Tsur D. Character Sets of Strings. Journal of Discrete Algorithms. 2007;5(2):330-340
A string is just a sequence of letters. But strings can be massive. Plant and animal genomes are str...
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we ...
A central problem in computational group theory is that of getting the table of ordinary characters ...
Given a string S over a finite alphabet Σ, the character set (also called the fingerprint) of a subs...
AbstractGiven a string S over a finite alphabet Σ, the character set (also called the fingerprint) o...
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever...
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever...
This document has been made available through Purdue e-Pubs, a service of the Purdue University Libr...
The proposed model of the character string allows to determine its degree of compliance of the forma...
AbstractIn this investigation of character tables of finite groups we study basic sets and associate...
Character sets of languages can be reduced by representing several different characters by one in ca...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
International audienceWe describe algorithms to represent and compute groups of Hecke characters. We...
Computational methods for finding the character table of a finite group require a stock of reducible...
Computational methods for finding the character table of a finite group require a stock of reducible...
A string is just a sequence of letters. But strings can be massive. Plant and animal genomes are str...
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we ...
A central problem in computational group theory is that of getting the table of ordinary characters ...
Given a string S over a finite alphabet Σ, the character set (also called the fingerprint) of a subs...
AbstractGiven a string S over a finite alphabet Σ, the character set (also called the fingerprint) o...
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever...
Strings (aka sequences or words) form the most basic and natural data structure. They occur whenever...
This document has been made available through Purdue e-Pubs, a service of the Purdue University Libr...
The proposed model of the character string allows to determine its degree of compliance of the forma...
AbstractIn this investigation of character tables of finite groups we study basic sets and associate...
Character sets of languages can be reduced by representing several different characters by one in ca...
AbstractBrauer’s theorem on induced characters is an invitation to an algorithm for computing the ch...
International audienceWe describe algorithms to represent and compute groups of Hecke characters. We...
Computational methods for finding the character table of a finite group require a stock of reducible...
Computational methods for finding the character table of a finite group require a stock of reducible...
A string is just a sequence of letters. But strings can be massive. Plant and animal genomes are str...
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we ...
A central problem in computational group theory is that of getting the table of ordinary characters ...
Add to ORKG