The following pages link to Alberto Apostolico (Q294937):
Displaying 50 items.
- Sequence similarity measures based on bounded Hamming distance (Q294940) (← links)
- A PTAS for the square tiling problem (Q476839) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Parallel detection of all palindromes in a string (Q673783) (← links)
- Efficient detection of quasiperiodicities in strings (Q688155) (← links)
- Parameterized searching with mismatches for run-length encoded strings (Q714802) (← links)
- The subsequence composition of a string (Q732027) (← links)
- Optimal superprimitivity testing for strings (Q811134) (← links)
- Motif discovery by monotone scores (Q876467) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- Scoring unusual words with varying mismatch errors (Q942993) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (Q959798) (← links)
- Ask not what stringology can do for you: advances in pattern matching driven by computational biology (Q964230) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- (Q1076521) (redirect page) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings (Q1085982) (← links)
- The longest common subsequence problem revisited (Q1098310) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- Finding maximum cliques on circular-arc graphs (Q1108807) (← links)
- Optimal off-line detection of repetitions in a string (Q1170893) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Erratum to: New clique and independent set algorithms for circle graphs (Q1208478) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- C-calculus: An elementary approach to some problems in pattern recognition (Q1251081) (← links)
- Matching for run-length encoded strings (Q1288529) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- Fibonacci arrays and their two-dimensional repetitions (Q1566729) (← links)
- Graph compression by BFS (Q1662490) (← links)
- String cadences (Q1676299) (← links)
- Efficient text fingerprinting via Parikh mapping (Q1827267) (← links)
- A speed-up for the commute between subword trees and DAWGs. (Q1853059) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- Data structures and algorithms for the string statistics problem (Q1913702) (← links)
- Speedup for a periodic subgraph miner (Q1944940) (← links)
- Fast gapped variants for Lempel-Ziv-Welch compression (Q2373875) (← links)
- Efficient algorithms for the periodic subgraphs mining problem (Q2376786) (← links)
- Modulated string searching (Q2437743) (← links)
- Detecting approximate periodic patterns (Q2437747) (← links)
- Motif patterns in 2D (Q2474071) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches (Q2814576) (← links)
- Robust transmission of unbounded strings using Fibonacci representations (Q3030717) (← links)
- OPTIMAL EXTRACTION OF IRREDUNDANT MOTIF BASES (Q3069742) (← links)
- Systolic Algorithms for String Manipulations (Q3309095) (← links)
- (Q3332275) (← links)
- Bridging Lossy and Lossless Compression by Motif Pattern Discovery (Q3439250) (← links)
