References analysis of the Wikipedia article "Suffix automaton" in the English version

arxiv.org (Global: 69^th place; English: 59^th place)

Rubinchik & Shur (2018), pp. 1–2 Rubinchik, Mikhail; Shur, Arseny M. (2018). "EERTREE: An efficient data structure for processing palindromes in strings". European Journal of Combinatorics. 68: 249–265. arXiv:1506.04862. doi:10.1016/J.EJC.2017.07.021. Zbl 1374.68131.

Brodnik & Jekovec (2018), p. 1 Brodnik, Andrej; Jekovec, Matevž (2018). "Sliding Suffix Tree". Algorithms. 11 (8): 118. arXiv:1801.07449. doi:10.3390/A11080118. Zbl 1458.68043.

doi.org (Global: 2^nd place; English: 2^nd place)

Crochemore & Vérin (1997), p. 192 Crochemore, Maxime; Vérin, Renaud (1997). "On compact directed acyclic word graphs". Structures in Logic and Computer Science. Lecture Notes in Computer Science. Vol. 1261. pp. 192–211. doi:10.1007/3-540-63246-8_12. ISBN 978-3-540-63246-7.

Weiner (1973) Weiner, Peter (1973). "Linear pattern matching algorithms". 14th Annual Symposium on Switching and Automata Theory (Swat 1973). pp. 1–11. doi:10.1109/SWAT.1973.13.

Slisenko (1983) Slisenko, A. O. (1983). "Detection of periodicities and string-matching in real time". Journal of Soviet Mathematics. 22 (3): 1316–1387. doi:10.1007/BF01084395. Zbl 0509.68043.

Chen & Seiferas (1985), p. 97 Chen, M. T.; Seiferas, Joel (1985). "Efficient and Elegant Subword-Tree Construction". Combinatorial Algorithms on Words. pp. 97–107. doi:10.1007/978-3-642-82456-2_7. ISBN 978-3-642-82458-6.

Blumer et al. (1987), p. 578 Blumer, A.; Blumer, J.; Haussler, D.; McConnell, R.; Ehrenfeucht, A. (1987). "Complete inverted files for efficient text retrieval and analysis". Journal of the ACM. 34 (3): 578–595. doi:10.1145/28869.28873. Zbl 1433.68118.

Crochemore & Hancart (1997), pp. 3–6 Crochemore, Maxime; Hancart, Christophe (1997). "Automata for Matching Patterns". Handbook of Formal Languages. pp. 399–462. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-08230-6.

Crochemore & Hancart (1997), pp. 27–31 Crochemore, Maxime; Hancart, Christophe (1997). "Automata for Matching Patterns". Handbook of Formal Languages. pp. 399–462. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-08230-6.

Inenaga et al. (2005), pp. 159–162 Inenaga, Shunsuke; Hoshino, Hiromasa; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo; Mauri, Giancarlo; Pavesi, Giulio (2005). "On-line construction of compact directed acyclic word graphs". Discrete Applied Mathematics. 146 (2): 156–179. doi:10.1016/J.DAM.2004.04.012. Zbl 1084.68137.

Inenaga et al. (2005), pp. 156–158 Inenaga, Shunsuke; Hoshino, Hiromasa; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo; Mauri, Giancarlo; Pavesi, Giulio (2005). "On-line construction of compact directed acyclic word graphs". Discrete Applied Mathematics. 146 (2): 156–179. doi:10.1016/J.DAM.2004.04.012. Zbl 1084.68137.

Fujishige et al. (2016), pp. 1–3 Fujishige, Yuta; Tsujimaru, Yuki; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki (2016). "Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets". 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 38:1–38:14. doi:10.4230/LIPICS.MFCS.2016.38. Zbl 1398.68703.

Crochemore & Hancart (1997), pp. 31–36 Crochemore, Maxime; Hancart, Christophe (1997). "Automata for Matching Patterns". Handbook of Formal Languages. pp. 399–462. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-08230-6.

Blumer (1987), p. 451 Blumer, Janet A. (1987). "How much is that DAWG in the window? A moving window algorithm for the directed acyclic word graph". Journal of Algorithms. 8 (4): 451–469. doi:10.1016/0196-6774(87)90045-9. Zbl 0636.68109.

Blumer et al. (1987), pp. 585–588 Blumer, A.; Blumer, J.; Haussler, D.; McConnell, R.; Ehrenfeucht, A. (1987). "Complete inverted files for efficient text retrieval and analysis". Journal of the ACM. 34 (3): 578–595. doi:10.1145/28869.28873. Zbl 1433.68118.

Blumer et al. (1987), pp. 588–589 Blumer, A.; Blumer, J.; Haussler, D.; McConnell, R.; Ehrenfeucht, A. (1987). "Complete inverted files for efficient text retrieval and analysis". Journal of the ACM. 34 (3): 578–595. doi:10.1145/28869.28873. Zbl 1433.68118.

Blumer et al. (1987), p. 593 Blumer, A.; Blumer, J.; Haussler, D.; McConnell, R.; Ehrenfeucht, A. (1987). "Complete inverted files for efficient text retrieval and analysis". Journal of the ACM. 34 (3): 578–595. doi:10.1145/28869.28873. Zbl 1433.68118.

Mohri, Moreno & Weinstein (2009), pp. 3558–3560 Mohri, Mehryar; Moreno, Pedro; Weinstein, Eugene (2009). "General suffix automaton construction algorithm and space bounds". Theoretical Computer Science. 410 (37): 3553–3562. doi:10.1016/J.TCS.2009.03.034. Zbl 1194.68143.

Blumer (1987), pp. 461–465 Blumer, Janet A. (1987). "How much is that DAWG in the window? A moving window algorithm for the directed acyclic word graph". Journal of Algorithms. 8 (4): 451–469. doi:10.1016/0196-6774(87)90045-9. Zbl 0636.68109.

Fiala & Greene (1989), p. 490 Fiala, E. R.; Greene, D. H. (1989). "Data compression with finite windows". Communications of the ACM. 32 (4): 490–505. doi:10.1145/63334.63341.

Larsson (1996) Larsson, N.J. (1996). "Extended application of suffix trees to data compression". Proceedings of Data Compression Conference - DCC '96. pp. 190–199. doi:10.1109/DCC.1996.488324. ISBN 0-8186-7358-3.

Brodnik & Jekovec (2018), p. 1 Brodnik, Andrej; Jekovec, Matevž (2018). "Sliding Suffix Tree". Algorithms. 11 (8): 118. arXiv:1801.07449. doi:10.3390/A11080118. Zbl 1458.68043.

Senft & Dvořák (2008), p. 109 Senft, Martin; Dvořák, Tomáš (2008). "Sliding CDAWG Perfection". String Processing and Information Retrieval. Lecture Notes in Computer Science. Vol. 5280. pp. 109–120. doi:10.1007/978-3-540-89097-3_12. ISBN 978-3-540-89096-6.

Inenaga et al. (2004) Inenaga, Shunsuke; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo (2004). "Compact directed acyclic word graphs for a sliding window". Journal of Discrete Algorithms. 2: 33–51. doi:10.1016/S1570-8667(03)00064-9. Zbl 1118.68755.

Crochemore & Hancart (1997), pp. 36–39 Crochemore, Maxime; Hancart, Christophe (1997). "Automata for Matching Patterns". Handbook of Formal Languages. pp. 399–462. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-08230-6.

Crochemore & Hancart (1997), pp. 39–41 Crochemore, Maxime; Hancart, Christophe (1997). "Automata for Matching Patterns". Handbook of Formal Languages. pp. 399–462. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-08230-6.

Yamamoto et al. (2014), p. 675 Yamamoto, Jun'ichi; I, Tomohiro; Bannai, Hideo; Inenaga, Shunsuke; Takeda, Masayuki (2014). "Faster Compact On-Line Lempel-Ziv Factorization". 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 675–686. doi:10.4230/LIPICS.STACS.2014.675. Zbl 1359.68341.

Crochemore et al. (2003), p. 211 Crochemore, Maxime; Iliopoulos, Costas S.; Navarro, Gonzalo; Pinzon, Yoan J. (2003). "A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval". String Processing and Information Retrieval. Lecture Notes in Computer Science. Vol. 2857. pp. 211–223. doi:10.1007/978-3-540-39984-1_16. ISBN 978-3-540-20177-9.

Mohri, Moreno & Weinstein (2009), p. 3553 Mohri, Mehryar; Moreno, Pedro; Weinstein, Eugene (2009). "General suffix automaton construction algorithm and space bounds". Theoretical Computer Science. 410 (37): 3553–3562. doi:10.1016/J.TCS.2009.03.034. Zbl 1194.68143.

Faro (2016), p. 145 Faro, Simone (2016). "Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences". Algorithms for Computational Biology. Lecture Notes in Computer Science. Vol. 9702. pp. 145–157. doi:10.1007/978-3-319-38827-4_12. ISBN 978-3-319-38826-7.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Inenaga et al. (2001), p. 1 Inenaga, Shunsuke; Hoshino, Hiromasa; Shinohara, Ayumi; Takeda, Masayuki; Arikawa, Setsuo (2001). "Construction of the CDAWG for a trie" (PDF). Prague Stringology Conference. Proceedings. pp. 37–48. CiteSeerX 10.1.1.24.2637.

Inenaga (2003), p. 1 Inenaga, Shunsuke (2003). "Bidirectional Construction of Suffix Trees" (PDF). Nordic Journal of Computing. 10 (1): 52–67. CiteSeerX 10.1.1.100.8726.

zbmath.org (Global: 1,923^rd place; English: 1,068^th place)

Slisenko (1983) Slisenko, A. O. (1983). "Detection of periodicities and string-matching in real time". Journal of Soviet Mathematics. 22 (3): 1316–1387. doi:10.1007/BF01084395. Zbl 0509.68043.

Brodnik & Jekovec (2018), p. 1 Brodnik, Andrej; Jekovec, Matevž (2018). "Sliding Suffix Tree". Algorithms. 11 (8): 118. arXiv:1801.07449. doi:10.3390/A11080118. Zbl 1458.68043.

Suffix automaton (English Wikipedia)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

ifmo.ru (Global: low place; English: low place)

is.ifmo.ru

kyushu-u.ac.jp (Global: 8,612^th place; English: low place)

str.i.kyushu-u.ac.jp

openlibrary.org (Global: 325^th place; English: 255^th place)

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

rubtsov.su (Global: low place; English: low place)

tohoku.ac.jp (Global: 9,956^th place; English: low place)

shino.ecei.tohoku.ac.jp

trpl7.ru (Global: low place; English: low place)

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

zbmath.org (Global: 1,923^rd place; English: 1,068^th place)

Suffix automaton (English Wikipedia)

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

ifmo.ru (Global: low place; English: low place)

is.ifmo.ru

kyushu-u.ac.jp (Global: 8,612th place; English: low place)

str.i.kyushu-u.ac.jp

openlibrary.org (Global: 325th place; English: 255th place)

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

rubtsov.su (Global: low place; English: low place)

tohoku.ac.jp (Global: 9,956th place; English: low place)

shino.ecei.tohoku.ac.jp

trpl7.ru (Global: low place; English: low place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

zbmath.org (Global: 1,923rd place; English: 1,068th place)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

kyushu-u.ac.jp (Global: 8,612^th place; English: low place)

openlibrary.org (Global: 325^th place; English: 255^th place)

psu.edu (Global: 207^th place; English: 136^th place)

tohoku.ac.jp (Global: 9,956^th place; English: low place)

worldcat.org (Global: 5^th place; English: 5^th place)

zbmath.org (Global: 1,923^rd place; English: 1,068^th place)