Costas S. Iliopoulos

According to our database1, Costas S. Iliopoulos
  • authored at least 287 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
The longest common substring problem.
Mathematical Structures in Computer Science, 2017

Fast circular dictionary-matching algorithm.
Mathematical Structures in Computer Science, 2017

Foreword.
Mathematics in Computer Science, 2017

Two strings at Hamming distance 1 cannot be both quasiperiodic.
Inf. Process. Lett., 2017

Two strings at Hamming distance 1 cannot be both quasiperiodic.
CoRR, 2017

Faster algorithms for 1-mappability of a sequence.
CoRR, 2017

How to answer a small batch of RMQs or LCA queries in practice.
CoRR, 2017

Optimal Computation of Overabundant Words.
CoRR, 2017

Palindromic Decompositions with Gaps and Errors.
CoRR, 2017

On avoided words, absent words, and their application to biological sequence analysis.
Algorithms for Molecular Biology, 2017

Optimal Computation of Overabundant Words.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Longest Common Factor After One Edit Operation.
Proceedings of the String Processing and Information Retrieval, 2017

Efficient Pattern Matching in Elastic-Degenerate Texts.
Proceedings of the Language and Automata Theory and Applications, 2017

Identification of Fingerprints using Circular String Approximation for Mobile Devices.
Proceedings of the Communication Papers of the 2017 Federated Conference on Computer Science and Information Systems, 2017

Efficient Computation of Palindromes in Sequences with Uncertainties.
Proceedings of the Engineering Applications of Neural Networks, 2017

Efficient Identification of k-Closed Strings.
Proceedings of the Engineering Applications of Neural Networks, 2017

Palindromic Decompositions with Gaps and Errors.
Proceedings of the Computer Science - Theory and Applications, 2017

On-Line Pattern Matching on Similar Texts.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Foreword.
Theor. Comput. Sci., 2016

Order-preserving indexing.
Theor. Comput. Sci., 2016

Linear-time superbubble identification algorithm for genome assembly.
Theor. Comput. Sci., 2016

Algorithms for Longest Common Abelian Factors.
Int. J. Found. Comput. Sci., 2016

Linear algorithm for conservative degenerate pattern matching.
Eng. Appl. of AI, 2016

Closed factorization.
Discrete Applied Mathematics, 2016

Efficient Pattern Matching in Elastic-Degenerate Strings.
CoRR, 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
CoRR, 2016

Optimal Computation of Avoided Words.
CoRR, 2016

Quasiperiodicities in Fibonacci strings.
Ars Comb., 2016

Erratum to: Circular sequence comparison: algorithms and applications.
Algorithms for Molecular Biology, 2016

Circular sequence comparison: algorithms and applications.
Algorithms for Molecular Biology, 2016

Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Optimal Computation of Avoided Words.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
Proceedings of the String Processing and Information Retrieval, 2016

Detection Of URL In Image Steganography.
Proceedings of the International Conference on Internet of Things and Cloud Computing, 2016

Smart Meter Data Analysis.
Proceedings of the International Conference on Internet of Things and Cloud Computing, 2016

Efficient Computation of Clustered-Clumps in Degenerate Strings.
Proceedings of the Artificial Intelligence Applications and Innovations, 2016

Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Global and local sequence alignment with a bounded number of gaps.
Theor. Comput. Sci., 2015

Antimagicness of Generalized Corona and Snowflake Graphs.
Mathematics in Computer Science, 2015

A note on the longest common compatible prefix problem for partial words.
J. Discrete Algorithms, 2015

Linear Algorithm for Conservative Degenerate Pattern Matching.
CoRR, 2015

Linear-Time Superbubble Identification Algorithm.
CoRR, 2015

Algorithms for Longest Common Abelian Factors.
CoRR, 2015

Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Circular Sequence Comparison with q-grams.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Average-Case Optimal Approximate Circular String Matching.
Proceedings of the Language and Automata Theory and Applications, 2015

SimpLiSMS: A Simple, Lightweight and Fast Approach for Structured Motifs Searching.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

A Filter-Based Approach for Approximate Circular Pattern Matching.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

Using Arabic Microblogs Features in Determining Credibility.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Order-preserving matching.
Theor. Comput. Sci., 2014

Extracting powers and periods in a word from its runs structure.
Theor. Comput. Sci., 2014

On the average number of regularities in a word.
Theor. Comput. Sci., 2014

Extending alignments with k-mismatches and ℓ-gaps.
Theor. Comput. Sci., 2014

The swap matching problem revisited.
Theor. Comput. Sci., 2014

New simple efficient algorithms computing powers and runs in strings.
Discrete Applied Mathematics, 2014

Abelian borders in binary words.
Discrete Applied Mathematics, 2014

Covering Problems for Partial Words and for Indeterminate Strings.
CoRR, 2014

Average-Case Optimal Approximate Circular String Matching.
CoRR, 2014

On the Average-case Complexity of Pattern Matching with Wildcards.
CoRR, 2014

Optimal computation of all tandem repeats in a weighted sequence.
Algorithms for Molecular Biology, 2014

Fast algorithms for approximate circular string matching.
Algorithms for Molecular Biology, 2014

Closed Factorization.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Covering Problems for Partial Words and for Indeterminate Strings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Evaluation of credibility assessment for microblogging: models and future directions.
Proceedings of the 14th International Conference on Knowledge Management and Data-driven Business, 2014

On-line Minimum Closed Covers.
Proceedings of the Artificial Intelligence Applications and Innovations, 2014

Detection of Web Spambot in the Presence of Decoy Actions.
Proceedings of the 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, 2014

A fast and lightweight filter-based algorithm for circular pattern matching.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2013
Enhanced string covering.
Theor. Comput. Sci., 2013

Efficient seed computation revisited.
Theor. Comput. Sci., 2013

Tree template matching in unranked ordered trees.
J. Discrete Algorithms, 2013

A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett., 2013

Querying highly similar sequences.
I. J. Computational Biology and Drug Design, 2013

Bipartite Ramsey numbers involving stars, stripes and trees.
EJGTA, 2013

Computing the Longest Previous Factor.
Eur. J. Comb., 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data
CoRR, 2013

Order-Preserving Suffix Trees and Their Algorithmic Applications
CoRR, 2013

Order Preserving Matching
CoRR, 2013

A Note on the Longest Common Compatible Prefix Problem for Partial Words.
CoRR, 2013

The Swap Matching Problem Revisited.
CoRR, 2013

Locating tandem repeats in weighted sequences in proteins.
BMC Bioinformatics, 2013

Overlapping factors in words.
Australasian J. Combinatorics, 2013

Maximal Palindromic Factorization.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
Proceedings of the String Processing and Information Retrieval, 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences.
Proceedings of the Engineering Applications of Neural Networks, 2013

Generic Algorithms for Factoring Strings.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

GapsMis: flexible sequence alignment with a bounded number of gaps.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
Improved algorithms for the range next value problem and applications.
Theor. Comput. Sci., 2012

Exact and approximate rhythm matching algorithms.
Int. J. on Digital Libraries, 2012

Editorial.
J. Discrete Algorithms, 2012

Editorial.
J. Discrete Algorithms, 2012

An algorithm for mapping short reads to a dynamically changing genomic sequence.
J. Discrete Algorithms, 2012

Tree template matching in ranked ordered trees by pushdown automata.
J. Discrete Algorithms, 2012

Efficient algorithms for three variants of the LPF table.
J. Discrete Algorithms, 2012

On left and right seeds of a string.
J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.
J. Comput. Syst. Sci., 2012

Computing all subtree repeats in ordered trees.
Inf. Process. Lett., 2012

Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome.
Int. J. Found. Comput. Sci., 2012

Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems.
Int. J. Found. Comput. Sci., 2012

A Note on Efficient Computation of All Abelian Periods in a String
CoRR, 2012

Identifying all abelian periods of a string in quadratic time and relevant problems
CoRR, 2012

Quasiperiodicities in Fibonacci strings
CoRR, 2012

New and Efficient Approaches to the Quasiperiodic Characterisation of a String.
Proceedings of the Prague Stringology Conference 2012, 2012

GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Conceptualization and Significance Study of a New Appliation CS-MIR.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Melodic String Matching via Interval Consolidation and Fragmentation.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Computing the Minimum λ-Cover in Weighted Sequences.
Proceedings of the Intelligent Computing Technology - 8th International Conference, 2012

Locating Tandem Repeats in Weighted Biological Sequences.
Proceedings of the Emerging Intelligent Computing Technology and Applications, 2012

Detection of fixed length web spambot using REAL (read aligner).
Proceedings of the CUBE International IT Conference & Exhibition, 2012

Overlapping repetitions in weighted sequence.
Proceedings of the CUBE International IT Conference & Exhibition, 2012

The Maximum Number of Squares in a Tree.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

On the repetitive collection indexing problem.
Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2012

2011
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs.
Mathematics in Computer Science, 2011

New complexity results for the k-covers problem.
Inf. Sci., 2011

Efficient Seeds Computation Revisited
CoRR, 2011

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata.
Proceedings of the Implementation and Application of Automata, 2011

Computing All Subtree Repeats in Ordered Ranked Trees.
Proceedings of the String Processing and Information Retrieval, 2011

Tree Indexing by Pushdown Automata and Repeats of Subtrees.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Efficient Seeds Computation Revisited.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

On the Right-Seed Array of a String.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Approximate string-matching with a single gap for sequence alignment.
Proceedings of the ACM International Conference on Bioinformatics, 2011

DynMap: mapping short reads to multiple related genomes.
Proceedings of the ACM International Conference on Bioinformatics, 2011

2010
Foreword.
Mathematics in Computer Science, 2010

Finite automata based algorithms on subsequences and supersequences of degenerate strings.
J. Discrete Algorithms, 2010

Number of Occurrences of powers in Strings.
Int. J. Found. Comput. Sci., 2010

Finding Patterns In Given Intervals.
Fundam. Inform., 2010

A Note on a priori Estimations of Classification Circuit Complexity.
Fundam. Inform., 2010

New Simple Efficient Algorithms Computing Powers and Runs in Strings.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Extracting Powers and Periods in a String from Its Runs Structure.
Proceedings of the String Processing and Information Retrieval, 2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Combinatorial ECG analysis for mobile devices.
Proceedings of the 11th ACM SIGMM International Conference on Multimedia Information Retrieval, 2010

On the Maximal Number of Cubic Runs in a String.
Proceedings of the Language and Automata Theory and Applications, 2010

Music Genre Classification via Compressive Sampling.
Proceedings of the 11th International Society for Music Information Retrieval Conference, 2010

Cover Array String Reconstruction.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches.
Proceedings of the Algorithms and Applications, 2010

Combinatorial Detection of Arrhythmia.
Proceedings of the BIOSIGNALS 2010, 2010

An algorithm for mapping short reads to a dynamically changing genomic sequence.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

REAL: an efficient REad ALigner for next generation sequencing reads.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

Varieties of Regularities in Weighted Sequences.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore.
Theor. Comput. Sci., 2009

A New Efficient Algorithm for Computing the Longest Common Subsequence.
Theory Comput. Syst., 2009

Algorithms for mapping short degenerate and weighted sequences to a reference genome.
I. J. Computational Biology and Drug Design, 2009

Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences.
Fundam. Inform., 2009

Toward a General Framework for Polyphonic Comparison.
Fundam. Inform., 2009

On the maximal number of highly periodic runs in a string
CoRR, 2009

Indexing Factors with Gaps.
Algorithmica, 2009

Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Validation and Decomposition of Partially Occluded Images with Holes.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies.
Proceedings of the Parallel Computing: From Multicores and GPU's to Petascale, 2009

LPF Computation Revisited.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies.
Proceedings of the International Joint Conferences on Bioinformatics, 2009

2008
Algorithms for computing variants of the longest common subsequence problem.
Theor. Comput. Sci., 2008

Property matching and weighted matching.
Theor. Comput. Sci., 2008

A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching.
Mathematics in Computer Science, 2008

Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia.
J. Discrete Algorithms, 2008

New efficient algorithms for the LCS and constrained LCS problems.
Inf. Process. Lett., 2008

Faster index for property matching.
Inf. Process. Lett., 2008

Optimal prefix and suffix queries on texts.
Inf. Process. Lett., 2008

Identifying Rhythms in Musical Texts.
Int. J. Found. Comput. Sci., 2008

Generalized approximate regularities in strings.
Int. J. Comput. Math., 2008

Algorithms for Computing the lambda-regularities in Strings.
Fundam. Inform., 2008

External Memory Algorithms for String Problems.
Fundam. Inform., 2008

Indexing Circular Patterns.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Conservative String Covering of Indeterminate Strings.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Improved Algorithms for the Range Next Value Problem and Applications.
Proceedings of the STACS 2008, 2008

A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Bounds on Powers in Strings.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Indexing Factors in DNA/RNA Sequences.
Proceedings of the Bioinformatics Research and Development, 2008

Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model.
Proceedings of the Bioinformatics Research and Development, 2008

2007
Linear time algorithm for the longest common repeat problem.
J. Discrete Algorithms, 2007

Algorithms for extracting motifs from biological weighted sequences.
J. Discrete Algorithms, 2007

Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences.
Journal of Computational Biology, 2007

Computing the lambda-covers of a string.
Inf. Sci., 2007

All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci., 2007

Locating Maximal Multirepeats in Multiple Strings Under Various Constraints.
Comput. J., 2007

The Constrained Longest Common Subsequence Problem for Degenerate Strings.
Proceedings of the Implementation and Application of Automata, 2007

Pattern Matching in Degenerate DNA/RNA Sequences.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

Local Transpositions in Alignment of Polyphonic Musical Sequences.
Proceedings of the String Processing and Information Retrieval, 2007

Indexing Factors with Gaps.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Pattern Matching Algorithms with Don't Cares.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Transformation of Suffix Arrays into Suffix Trees on the MPI Environment.
Proceedings of the Rough Sets, 2007

Finding Patterns in Given Intervals.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Weighted Degenerated Approximate Pattern Matching.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Algorithms for Computing the Longest Parameterized Common Subsequence.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

A New Efficient Algorithm for Computing the Longest Common Subsequence.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Longest repeats with a block of k don't cares.
Theor. Comput. Sci., 2006

Computation of Repetitions and Regularities of Biologically Weighted Sequences.
Journal of Computational Biology, 2006

The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications.
Fundam. Inform., 2006

Finding Common Motifs with Gaps Using Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

Song classifications for dancing.
Proceedings of the Prague Stringology Conference, 2006

Computing the Minimum Approximate lambda-Cover of a String.
Proceedings of the String Processing and Information Retrieval, 2006

Simple Algorithm for Sorting the Fibonacci String Rotations.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Algorithms for Computing Variants of the Longest Common Subsequence Problem.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Approximate Matching in Weighted Sequences.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Property Matching and Weighted Matching.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

Finding Patterns with Variable Length Gaps or Don't Cares.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Computing the lambda-Seeds of a String.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Implementing approximate regularities.
Mathematical and Computer Modelling, 2005

Bit-parallel (delta, gamma)-matching and suffix automata.
J. Discrete Algorithms, 2005

Computing the Repetitions in a Biological Weighted Sequence.
Journal of Automata, Languages and Combinatorics, 2005

The Complexity of the Minimum k-Cover Problem.
Journal of Automata, Languages and Combinatorics, 2005

Approximate Seeds of Strings.
Journal of Automata, Languages and Combinatorics, 2005

A first approach to finding common motifs with gaps.
Int. J. Found. Comput. Sci., 2005

Approximation algorithm for the cyclic swap problem.
Proceedings of the Prague Stringology Conference, 2005

Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval.
Proceedings of the ISMIR 2005, 2005

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
Proceedings of the ISMIR 2005, 2005

Faster Algorithms for delta, gamma-Matching and Related Problems.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Approximate string matching for music analysis.
Soft Comput., 2004

A First Approach to Finding Common Motifs With Gaps.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

Linear Time Algorithm for the Longest Common Repeat Problem.
Proceedings of the String Processing and Information Retrieval, 2004

Motif Extraction from Weighted Sequences.
Proceedings of the String Processing and Information Retrieval, 2004

Longest Repeats with a Block of Don't Cares.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Efficient Algorithms for Handling Molecular Weighted Sequences.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

String Matching with Swaps in a Weighted Sequence.
Proceedings of the Computational and Information Science, First International Symposium, 2004

String Algorithmics.
College Publications, ISBN: 978-1-904987-02-4, 2004

2003
Truncated suffix trees and their application to data compression.
Theor. Comput. Sci., 2003

String Regularities with Don't Cares.
Nord. J. Comput., 2003

Editorial.
Journal of Automata, Languages and Combinatorics, 2003

On special families of morphisms related to [delta]-matching and don't care symbols.
Inf. Process. Lett., 2003

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
Fundam. Inform., 2003

Occurrence and Substring Heuristics for i-Matching.
Fundam. Inform., 2003

Computing the Repetitions in a Weighted Sequence.
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Computing the Minimum k-Cover of a String.
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Approximate Seeds of Strings.
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
Proceedings of the String Processing and Information Retrieval, 2003

2002
Recovering an LCS in O(n2/w) Time and Space.
Revista Colombiana de Computación, 2002

Approximate String Matching with Gaps.
Nord. J. Comput., 2002

On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice.
Int. J. Comput. Math., 2002

Algorithms for Computing Approximate Repetitions in Musical Sequences.
Int. J. Comput. Math., 2002

String Regularities with Don't Cares.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

String Matching with Gaps for Musical Melodic Recognition.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

Validation and Decomposition of Partially Occluded Images.
Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

Identifying Occurrences of Maximal Pairs in Multiple Strings.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Three Heuristics for delta-Matching: delta-BM Algorithms.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Approximate periods of strings.
Theor. Comput. Sci., 2001

Approximate Musical Evolution.
Computers and the Humanities, 2001

Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects.
Computers and the Humanities, 2001

On-Line Validation and Analysis of Partially Occluded Images.
Journal of Automata, Languages and Combinatorics, 2001

Distributed Pattern Matching Using Finite Automata.
Journal of Automata, Languages and Combinatorics, 2001

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem.
Inf. Process. Lett., 2001

Decomposition of Partially Occluded Strings in the Presence of Errors.
IJPRAI, 2001

Computing Evolutionary Chains in Musical Sequences.
Electr. J. Comb., 2001

The Max-Shift Algorithm for Approximate String Matching.
Proceedings of the Algorithm Engineering, 2001

Approximate String Matching in Musical Sequences.
Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

2000
Combinatorial Algorithms - Preface.
Theor. Comput. Sci., 2000

Optimal parallel analysis and decomposition of partially occluded strings.
Parallel Computing, 2000

Computing Approximate Repetitions in Musical Sequences.
Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

Fast Evolutionary Chains.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Finding Motifs with Gaps.
Proceedings of the ISMIR 2000, 2000

1999
Quasiperiodicity and String Covering.
Theor. Comput. Sci., 1999

Quasiperiodicity: From Detection to Normal Forms.
Journal of Automata, Languages and Combinatorics, 1999

Approximate Periods of Strings.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Two-Dimensional Prefix String Matching and Covering on Square Matrices.
Algorithmica, 1998

Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract).
Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998

Massively Parallel Suffix Array Construction.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

1997
A Characterization of the Squares in a Fibonacci String.
Theor. Comput. Sci., 1997

1996
A Work-Time Optimal Algorithm for Computing All String Covers.
Theor. Comput. Sci., 1996

Optimal Parallel Superprimitivity Testing for Square Arrays.
Parallel Processing Letters, 1996

A Pram Algorithm for a Special Case of the Set Partition Problem.
Parallel Algorithms Appl., 1996

Covering a String.
Algorithmica, 1996

1995
The Subtree Max Gap Problem with Application to Parallel String Covering.
Inf. Comput., 1995

1994
Parallel RAM Algorithms for Factorizing Words.
Theor. Comput. Sci., 1994

A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem.
Parallel Processing Letters, 1994

The Subtree Max Gap Problem with Application to Parallel String Covering.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Covering a String.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992
Optimal Algorithms for Computing the canonical form of a circular string.
Theor. Comput. Sci., 1992

1991
Optimal Superprimitivity Testing for Strings.
Inf. Process. Lett., 1991

1989
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations.
SIAM J. Comput., 1989

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix.
SIAM J. Comput., 1989

PRAM Algorithms for Identifying Polygon Similarity.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988
On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems.
Theor. Comput. Sci., 1988

Parallel Construction of a Suffix Tree with Applications.
Algorithmica, 1988

1987
On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem.
Proceedings of the Parallel Algorithms and Architectures, 1987

1986
Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem.
Acta Inf., 1986

1985
Computing in General Abelian Groups is Hard.
Theor. Comput. Sci., 1985

Analysis of Algorithms on Problems in General Abelian Groups.
Inf. Process. Lett., 1985

Computing a Basis for a Finite Abelian p-Group.
Inf. Process. Lett., 1985

Gaussian Elimination over a Euclidean Ring.
Proceedings of the EUROCAL '85, 1985

Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups.
Proceedings of the EUROCAL '85, 1985

1982
Analysis of an Algorithm for Composition of Binary Quadratic Forms.
J. Algorithms, 1982


  Loading...