Computing Longest Previous Factor in linear time and applications
Information Processing Letters
Learning Balls of Strings from Edit Corrections
The Journal of Machine Learning Research
Context-Sensitive Grammar Transform: Compression and Pattern Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
New Perspectives on the Prefix Array
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Critical Edition of Sanskrit Texts
Sanskrit Computational Linguistics
Lyndon + Christoffel = digitally convex
Pattern Recognition
From Nerode's congruence to suffix automata with mismatches
Theoretical Computer Science
Average-optimal string matching
Journal of Discrete Algorithms
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science
Discovering Networks for Global Propagation of Influenza A (H3N2) Viruses by Clustering
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
An Automaton for Motifs Recognition in DNA Sequences
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Code clone detection using parsing actions
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Combinatorics on partial word correlations
Journal of Combinatorial Theory Series A
String distances and uniformities
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
Science of Computer Programming
Fast computation of a longest increasing subsequence and application
Information and Computation
Solving longest common subsequence and related problems on graphical processing units
Software—Practice & Experience
IP routing processing with graphic processors
Proceedings of the Conference on Design, Automation and Test in Europe
Building the minimal automaton of A*X in linear time, when X is of bounded cardinality
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
On trace inclusion optimization problems
Cybernetics and Systems Analysis
Extracting powers and periods in a string from its runs structure
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
The gapped suffix array: a new index structure for fast approximate matching
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Computing Longest Previous non-overlapping Factors
Information Processing Letters
Negative selection algorithms on strings with efficient training and linear-time classification
Theoretical Computer Science
An extension of the Lyndon--Schützenberger result to pseudoperiodic words
Information and Computation
Finite automata for generalized approach to backward pattern matching
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Building phylogeny with minimal absent words
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On the right-seed array of a string
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Reversing longest previous factor tables is hard
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A text-based decision support system for financial sequence prediction
Decision Support Systems
AC-Suffix-Tree: Buffer Free String Matching on Out-of-Sequence Packets
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A memetic grammar inference algorithm for language learning
Applied Soft Computing
Complexity of operations on cofinite languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Optimal pattern matching in LZW compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms
Counting occurrences for a finite set of words: Combinatorial methods
ACM Transactions on Algorithms (TALG)
Using minimal absent words to build phylogeny
Theoretical Computer Science
Deciding representability of sets of words of equal length
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
The maximum number of squares in a tree
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
An efficient linear pseudo-minimization algorithm for aho-corasick automata
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Hardness of longest common subsequence for sequences with bounded run-lengths
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Computing the Longest Previous Factor
European Journal of Combinatorics
Overlapping repetitions in weighted sequence
Proceedings of the CUBE International Information Technology Conference
Pattern discovery in annotated dialogues using dynamic programming
International Journal of Intelligent Information and Database Systems
FOCUS: an index for continuous subsequence pattern queries
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Computing the maximal-exponent repeats of an overlap-free string in linear time
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient data structures for the factor periodicity problem
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
On left and right seeds of a string
Journal of Discrete Algorithms
Quotient complexity of ideal languages
Theoretical Computer Science
Deciding representability of sets of words of equal length
Theoretical Computer Science
Efficient seed computation revisited
Theoretical Computer Science
Optimal Pattern Matching in LZW Compressed Strings
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
A note on a simple computation of the maximal suffix of a string
Journal of Discrete Algorithms
On parsing optimality for dictionary-based text compression-the Zip case
Journal of Discrete Algorithms
GapsMis: flexible sequence alignment with a bounded number of gaps
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
MoTeX: A word-based HPC tool for MoTif eXtraction
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Theoretical Computer Science
A prediction framework based on contextual data to support Mobile Personalized Marketing
Decision Support Systems
New simple efficient algorithms computing powers and runs in strings
Discrete Applied Mathematics
Extracting powers and periods in a word from its runs structure
Theoretical Computer Science
Linear computation of unbordered conjugate on unordered alphabet
Theoretical Computer Science
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Theory of Computing Systems
| Hi-index | 0.01 |
Describing algorithms in a C-like language, this text presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases.