Minimal Discriminating Words Problem Revisited

DOI10.1007/978-3-319-02432-5_17MaRDI QIDQ2856588zbMATH OpenOpenAlexWikidataFDO

Authors Paweł Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya

Publication date 29 October 2013

Published in String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02432-5_17

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1206597
• A synergic approach to the minimal uncompletable words problem
• On minimal words with given subword complexity
• Computing minimum length representations of sets of words of uniform length
• Computing Minimum Length Representations of Sets of Words of Uniform Length
• On repetition-free binary words of minimal density
• Counting minimal semi-Sturmian words
• Words of minimum rank in deterministic finite automata
• Minimum entropy approach to word segmentation problems
• scientific article; zbMATH DE number 1222604

Cited in

(5)

• scientific article; zbMATH DE number 2051146 (Why is no real title available?)
• Computing discriminating and generic words
• The Restricted Word Shadow Problem
• Succinct indexes for reporting discriminating and generic words
• Succinct indexes for reporting discriminating and generic words

This page was built for publication: Minimal Discriminating Words Problem Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856588)