Efficient Seeds Computation Revisited

DOI10.1007/978-3-642-21458-5_30zbMath1339.68328arXiv1104.3153OpenAlexW2619263276MaRDI QIDQ3011867

Solon P. Pissis, B. Szreder, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Walen, Wojciech Rytter, Michalis Christou, Marcin Kubica, Jakub Radoszewski

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.3153

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

Computing covers using prefix tables, Two strings at Hamming distance 1 cannot be both quasiperiodic, Efficient seed computation revisited, Enhanced string covering, Computing maximal-exponent factors in an overlap-free word, String Covering: A Survey, Computing regularities in strings: a survey, IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS, On approximate enhanced covers under Hamming distance, A Linear-Time Algorithm for Seeds Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient detection of quasiperiodicities in strings
• Succinct data structures for flexible text retrieval systems
• An on-line string superprimitivity test
• Covering a string
• The subtree max gap problem with application to parallel string covering
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Jewels of Stringology
• Algorithms on Strings
• Computing the cover array in linear time