The following pages link to Costas S. Iliopoulos (Q200907):
Displayed 50 items.
- Item:Q200907 (redirect page) (← links)
- Order-preserving indexing (Q294954) (← links)
- The swap matching problem revisited (Q300248) (← links)
- Closed factorization (Q313756) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Enhanced string covering (Q393116) (← links)
- Tree template matching in unranked ordered trees (Q396647) (← links)
- An algorithm for mapping short reads to a dynamically changing genomic sequence (Q414417) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- A work-time optimal algorithm for computing all string covers (Q671438) (← links)
- Construction of antimagic labeling for the Cartesian product of regular graphs (Q691635) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- Implementing approximate regularities (Q815420) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Property matching and weighted matching (Q932325) (← links)
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching (Q942989) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- Item:Q200907 (redirect page) (← links)
- On special families of morphisms related to \(\delta \)-matching and don't care symbols (Q1007535) (← links)
- Analysis of algorithms on problems in general abelian groups (Q1062753) (← links)
- Computing in general Abelian groups is hard (Q1070820) (← links)
- Computing a basis for a finite Abelian p-group (Q1074705) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- Item:Q200907 (redirect page) (← links)
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems (Q1106934) (← links)
- Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
- Quasiperiodicity and string covering (Q1292493) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- Two-dimensional prefix string matching and covering on square matrices (Q1386343) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Recent advances of palindromic factorization (Q1642682) (← links)
- How to answer a small batch of RMQs or LCA queries in practice (Q1642718) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Optimal computation of avoided words (Q1708407) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- Approximate string matching for music analysis (Q1769662) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)