Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Costas S. Iliopoulos - MaRDI portal

Costas S. Iliopoulos

From MaRDI portal
(Redirected from Person:235231)
Person:200907

Available identifiers

zbMath Open iliopoulos.costas-sWikidataQ102407419 ScholiaQ102407419MaRDI QIDQ200907

List of research outcomes

PublicationDate of PublicationType
Finding the cyclic covers of a string2023-11-24Paper
Maximal degenerate palindromes with gaps and mismatches2023-10-12Paper
Efficient computation of sequence mappability2023-07-28Paper
Longest common prefixes with \(k\)-errors and applications2023-07-28Paper
Longest property-preserved common factor2023-07-28Paper
Maximal motif discovery in a sliding window2023-07-28Paper
Property Suffix Array with Applications in Indexing Weighted Sequences2023-05-23Paper
Finding the Anticover of a String2023-02-07Paper
Internal Quasiperiod Queries2022-12-22Paper
Quasi-Linear-Time Algorithm for Longest Common Circular Factor2022-07-18Paper
Computing the Antiperiod(s) of a String2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50903612022-07-18Paper
Efficient computation of sequence mappability2022-05-03Paper
Efficient pattern matching in elastic-degenerate strings2021-07-21Paper
Comparing Degenerate Strings2021-05-20Paper
Efficient Identification of k-Closed Strings2021-04-19Paper
Shortest covers of all cyclic shifts of a string2021-04-14Paper
Longest Common Factor After One Edit Operation2021-02-16Paper
Linear-Time Algorithm for Long LCF with k Mismatches2020-12-16Paper
Longest Common Prefixes with k-Mismatches and Applications2020-10-21Paper
Searching and Indexing Circular Patterns2020-08-07Paper
Shortest covers of all cyclic shifts of a string2020-07-22Paper
Optimal Computation of Overabundant Words2020-05-27Paper
On-line pattern matching on similar texts2020-05-25Paper
Longest property-preserved common factor: a new string-processing framework2020-02-20Paper
Faster algorithms for 1-mappability of a sequence2020-02-20Paper
Property suffix array with applications2020-02-12Paper
Off-line and on-line algorithms for closed string factorization2019-10-07Paper
On overabundant words and their application to biological sequence analysis2019-10-07Paper
Efficient enumeration of non-equivalent squares in partial words with few holes2019-06-06Paper
On-line weighted pattern matching2019-05-02Paper
Efficient Computation of Palindromes in Sequences with Uncertainties*2019-01-17Paper
Near-optimal computation of runs over general alphabet via non-crossing LCE queries2018-10-17Paper
Recent advances of palindromic factorization2018-06-15Paper
How to answer a small batch of RMQs or LCA queries in practice2018-06-15Paper
Faster algorithms for 1-mappability of a sequence2018-03-26Paper
Optimal computation of avoided words2018-03-23Paper
Covering problems for partial words and for indeterminate strings2017-11-06Paper
Efficient enumeration of non-equivalent squares in partial words with few holes2017-10-23Paper
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties.2017-10-17Paper
Text redundancies2017-10-06Paper
Two strings at Hamming distance 1 cannot be both quasiperiodic2017-09-19Paper
Palindromic decompositions with gaps and errors2017-08-22Paper
Circular Sequence Comparison with q-grams2017-07-25Paper
Efficient pattern matching in elastic-degenerate strings2017-06-01Paper
https://portal.mardi4nfdi.de/entity/Q29783012017-04-21Paper
Fast circular dictionary-matching algorithm2017-04-04Paper
The longest common substring problem2017-04-04Paper
Algorithms for Longest Common Abelian Factors2016-11-18Paper
Closed factorization2016-09-12Paper
The swap matching problem revisited2016-06-27Paper
Order-preserving indexing2016-06-16Paper
https://portal.mardi4nfdi.de/entity/Q28099422016-05-30Paper
Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis2016-05-03Paper
Average-Case Optimal Approximate Circular String Matching2016-04-08Paper
Linear-time superbubble identification algorithm for genome assembly2015-12-08Paper
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment2015-09-30Paper
New simple efficient algorithms computing powers and runs in strings2015-09-22Paper
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance2015-09-15Paper
Covering problems for partial words and for indeterminate strings2015-09-11Paper
A note on the longest common compatible prefix problem for partial words2015-08-24Paper
Global and local sequence alignment with a bounded number of gaps2015-04-29Paper
Antimagicness of generalized corona and snowflake graphs2015-03-25Paper
Bipartite Ramsey numbers involving stars, stripes and trees2015-03-05Paper
Tree template matching in unranked ordered trees2014-08-13Paper
https://portal.mardi4nfdi.de/entity/Q28758972014-08-12Paper
https://portal.mardi4nfdi.de/entity/Q51695782014-07-10Paper
Abelian borders in binary words2014-05-06Paper
Degree/diameter problem for trees and pseudotrees2014-04-25Paper
On the average number of regularities in a word2014-03-13Paper
Order-preserving matching2014-03-13Paper
Extending alignments with \(k\)-mismatches and \(\ell\)-gaps2014-03-13Paper
Extracting powers and periods in a word from its runs structure2014-01-22Paper
Suffix Tree of Alignment: An Efficient Index for Similar Data2014-01-17Paper
Enhanced string covering2014-01-16Paper
Efficient seed computation revisited2014-01-09Paper
https://portal.mardi4nfdi.de/entity/Q28666032013-12-13Paper
Tree template matching in ranked ordered trees by pushdown automata2013-06-24Paper
On left and right seeds of a string2013-06-24Paper
IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS2013-06-06Paper
Generic Algorithms for Factoring Strings2013-04-09Paper
Computing all subtree repeats in ordered trees2013-03-21Paper
A note on efficient computation of all abelian periods in a string2013-03-20Paper
https://portal.mardi4nfdi.de/entity/Q49107202013-03-19Paper
NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES2013-02-21Paper
Construction of antimagic labeling for the Cartesian product of regular graphs2012-12-03Paper
Computing the longest previous factor2012-11-15Paper
The maximal number of cubic runs in a word2012-11-06Paper
PARALLEL ALGORITHMS FOR MAPPING SHORT DEGENERATE AND WEIGHTED DNA SEQUENCES TO A REFERENCE GENOME2012-08-30Paper
The Maximum Number of Squares in a Tree2012-08-14Paper
Improved algorithms for the range next value problem and applications2012-06-25Paper
An algorithm for mapping short reads to a dynamically changing genomic sequence2012-05-11Paper
Efficient algorithms for three variants of the LPF table2012-05-11Paper
On the Right-Seed Array of a String2011-08-17Paper
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata2011-07-29Paper
Efficient Seeds Computation Revisited2011-06-29Paper
New complexity results for the \(k\)-covers problem2011-06-22Paper
Finding Patterns In Given Intervals2011-06-14Paper
A Note on a priori Estimations of Classification Circuit Complexity2011-06-10Paper
Validation and Decomposition of Partially Occluded Images2011-04-01Paper
NUMBER OF OCCURRENCES OF POWERS IN STRINGS2010-09-06Paper
https://portal.mardi4nfdi.de/entity/Q35767532010-08-02Paper
Cover Array String Reconstruction2010-07-26Paper
Algorithms for Three Versions of the Shortest Common Superstring Problem2010-07-26Paper
Varieties of Regularities in Weighted Sequences2010-07-20Paper
Optimal prefix and suffix queries on texts2010-06-09Paper
https://portal.mardi4nfdi.de/entity/Q35659092010-06-07Paper
https://portal.mardi4nfdi.de/entity/Q35659162010-06-07Paper
https://portal.mardi4nfdi.de/entity/Q35659332010-06-07Paper
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences2010-05-28Paper
On the Maximal Number of Cubic Runs in a String2010-05-26Paper
Finite automata based algorithms on subsequences and supersequences of degenerate strings2010-05-25Paper
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches2010-05-04Paper
New efficient algorithms for the LCS and constrained LCS problems2010-04-19Paper
Faster index for property matching2010-03-24Paper
String Processing and Information Retrieval2010-02-09Paper
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences2010-02-05Paper
Toward a General Framework for Polyphonic Comparison2010-02-05Paper
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays2010-01-28Paper
LPF Computation Revisited2009-12-11Paper
A new efficient algorithm for computing the longest common subsequence2009-10-19Paper
Indexing factors with gaps2009-07-24Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
On special families of morphisms related to \(\delta \)-matching and don't care symbols2009-03-23Paper
https://portal.mardi4nfdi.de/entity/Q55063262009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q55063272009-01-28Paper
IDENTIFYING RHYTHMS IN MUSICAL TEXTS2008-11-03Paper
Bounds on Powers in Strings2008-10-30Paper
Finding Patterns in Given Intervals2008-09-17Paper
A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching2008-09-08Paper
Algorithms for computing variants of the longest common subsequence problem2008-07-10Paper
Property matching and weighted matching2008-07-10Paper
Algorithms for Computing the Longest Parameterized Common Subsequence2008-06-17Paper
The Constrained Longest Common Subsequence Problem for Degenerate Strings2008-06-10Paper
Algorithms for Computing Variants of the Longest Common Subsequence Problem2008-04-24Paper
Generalized approximate regularities in strings2008-03-27Paper
Indexing Circular Patterns2008-03-25Paper
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns2008-03-07Paper
Indexing Factors with Gaps2008-03-07Paper
https://portal.mardi4nfdi.de/entity/Q54461222008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54461242008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54461282008-03-06Paper
Computing the λ-Seeds of a String2008-01-04Paper
A New Efficient Algorithm for Computing the Longest Common Subsequence2008-01-04Paper
Algorithms for extracting motifs from biological weighted sequences2007-10-30Paper
Linear time algorithm for the longest common repeat problem2007-10-30Paper
Computing the \(\lambda \)-covers of a string2007-10-10Paper
Property Matching and Weighted Matching2007-09-14Paper
Approximate Matching in Weighted Sequences2007-09-14Paper
Finding Patterns with Variable Length Gaps or Don’t Cares2007-09-10Paper
Finding Common Motifs with Gaps Using Finite Automata2007-09-06Paper
https://portal.mardi4nfdi.de/entity/Q34210282007-02-12Paper
SOFSEM 2006: Theory and Practice of Computer Science2006-11-14Paper
String Processing and Information Retrieval2006-10-24Paper
String Processing and Information Retrieval2006-10-24Paper
Longest repeats with a block of \(k\) don't cares2006-10-20Paper
The subtree max gap problem with application to parallel string covering2006-10-10Paper
Computational and Information Science2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54806582006-08-03Paper
https://portal.mardi4nfdi.de/entity/Q33714092006-02-21Paper
Implementing approximate regularities2006-02-16Paper
A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS2005-12-15Paper
Combinatorial Pattern Matching2005-12-14Paper
Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata2005-10-27Paper
https://portal.mardi4nfdi.de/entity/Q30248032005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46734122005-04-29Paper
Approximate string matching for music analysis2005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q47376952004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47376992004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44719912004-08-03Paper
https://portal.mardi4nfdi.de/entity/Q44545482004-03-08Paper
https://portal.mardi4nfdi.de/entity/Q44329702003-12-15Paper
https://portal.mardi4nfdi.de/entity/Q44329742003-10-29Paper
Truncated suffix trees and their application to data compression.2003-08-17Paper
Algorithms For Computing Approximate Repetitions In Musical Sequences2003-02-06Paper
https://portal.mardi4nfdi.de/entity/Q47885502003-01-29Paper
A fast and practical bit-vector algorithm for the longest common subsequence problem2002-07-25Paper
https://portal.mardi4nfdi.de/entity/Q43307242002-05-14Paper
Approximate periods of strings2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q31501812002-01-01Paper
On-Line Analysis And Validation Of Partially Occluded Images: Implementation And Practice2002-01-01Paper
Computing evolutionary chains in musical sequences2001-10-16Paper
https://portal.mardi4nfdi.de/entity/Q27312772001-07-29Paper
https://portal.mardi4nfdi.de/entity/Q27082522001-04-17Paper
https://portal.mardi4nfdi.de/entity/Q49396002000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45039642000-09-14Paper
Optimal parallel analysis and decomposition of partially occluded strings2000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q42507381999-12-19Paper
Quasiperiodicity and string covering1999-06-21Paper
Two-dimensional prefix string matching and covering on square matrices1998-05-24Paper
https://portal.mardi4nfdi.de/entity/Q31289121997-04-23Paper
A work-time optimal algorithm for computing all string covers1997-02-27Paper
On the lower bound for parallel string matching1997-02-13Paper
Covering a string1996-10-16Paper
A fast average case algorithm for lyndon decomposition1996-10-07Paper
Parallel RAM algorithms for factorizing words1995-01-26Paper
Optimal algorithms for computing the canonical form of a circular string1992-09-26Paper
Optimal superprimitivity testing for strings1991-01-01Paper
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 Matrix1989-01-01Paper
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31973271989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843541989-01-01Paper
Parallel construction of a suffix tree with applications1988-01-01Paper
On the computational complexity of the Abelian permutation group structure, membership and intersection problems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37828111987-01-01Paper
Monte Carlo circuits for the abelian permutation group intersection problem1986-01-01Paper
Analysis of algorithms on problems in general abelian groups1985-01-01Paper
Computing in general Abelian groups is hard1985-01-01Paper
Computing a basis for a finite Abelian p-group1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37055941985-01-01Paper
Analysis of an algorithm for composition of binary quadratic forms1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Costas S. Iliopoulos