TY - JOUR
T1 - Minimal de bruijn sequence in a language with forbidden substrings
AU - Moreno, Eduardo
AU - Matamala, Martín
N1 - Funding Information:
★ Partially supported by ECOS C00E03 (French-Chilean Cooperation), Programa Ini-ciativa Científica Milenio P01-005, and CONICYT Ph.D. Fellowship.
PY - 2004
Y1 - 2004
N2 - Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, applying the previous strategy over the corresponding de Bruijn graph, we finish with an Eulerian cycle, in order to obtain the minimal de Bruijn sequence of the language.
AB - Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, applying the previous strategy over the corresponding de Bruijn graph, we finish with an Eulerian cycle, in order to obtain the minimal de Bruijn sequence of the language.
UR - http://www.scopus.com/inward/record.url?scp=33745599914&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30559-0_14
DO - 10.1007/978-3-540-30559-0_14
M3 - Article
AN - SCOPUS:33745599914
SN - 0302-9743
VL - 3353
SP - 168
EP - 176
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -