User:Adamant.pwn/sandbox

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This is the user sandbox of Adamant.pwn. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here.

Other sandboxes: Main sandbox | Template sandbox

Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review!

Литература

Peter Weiner (October 1973). "Linear pattern matching algorithms". Symposium on Foundations of Computer Science: 1–11. CiteSeerX 10.1.1.474.9582. doi:10.1109/SWAT.1973.13. Wikidata Q29541479.
Vaughan Ronald Pratt (1973), Improvements and applications for the Weiner repetition finder, OCLC 726598262, Wikidata Q90300966
Anatoly Olesievich Slisenko (1983). "Detection of periodicities and string-matching in real time". Journal of Mathematical Sciences. 22 (3): 1316–1387. doi:10.1007/BF01084395. ISSN 1072-3374. Zbl 0509.68043. Wikidata Q90305414.
Anselm Cyril Blumer; Janet Blumer; Andrzej Ehrenfeucht; David Haussler; Ross McConnell (1984). Building the minimal DFA for the set of all subwords of a word on-line in linear time. pp. 109–118. doi:10.1007/3-540-13345-3_9. ISBN 978-3-540-13345-2. Wikidata Q90309073. {{cite book}}: |journal= ignored (help)
Anselm Cyril Blumer; Janet Blumer; Andrzej Ehrenfeucht; David Haussler; Ross McConnell (July 1987). "Complete inverted files for efficient text retrieval and analysis". Journal of the ACM. 34 (3): 578–595. CiteSeerX 10.1.1.87.6824. doi:10.1145/28869.28873. ISSN 0004-5411. Zbl 1433.68118. Wikidata Q90311855.
Janet Blumer (December 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. ISSN 0196-6774. Zbl 0636.68109. Wikidata Q90327976.
Mu-Tian Chen; Joel Seiferas (1985). Efficient and Elegant Subword-Tree Construction. pp. 97–107. CiteSeerX 10.1.1.632.4. doi:10.1007/978-3-642-82456-2_7. ISBN 978-3-642-82456-2. Wikidata Q90329833. {{cite book}}: |journal= ignored (help)
Shunsuke Inenaga (March 2003). "Bidirectional Construction of Suffix Trees" (PDF). Nordic Journal of Computing. 10 (1): 52–67. CiteSeerX 10.1.1.100.8726. ISSN 1236-6064. Wikidata Q90335534.
Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi (March 2005). "On-line construction of compact directed acyclic word graphs". Discrete Applied Mathematics. 146 (2): 156–179. CiteSeerX 10.1.1.1039.6992. doi:10.1016/J.DAM.2004.04.012. ISSN 0166-218X. Zbl 1084.68137. Wikidata Q57518591.
Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (2001). "Construction of the CDAWG for a trie" (PDF). Prague Stringology Conference. Proceedings: 37–48. CiteSeerX 10.1.1.24.2637. Wikidata Q90341606.
Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (March 2004). "Compact directed acyclic word graphs for a sliding window". Journal of Discrete Algorithms. 2 (1): 33–51. CiteSeerX 10.1.1.101.358. doi:10.1016/S1570-8667(03)00064-9. ISSN 1570-8667. Zbl 1118.68755. Wikidata Q90345535.
Jun'ichi Yamamoto; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (2014). Faster Compact On-Line Lempel-Ziv Factorization (PDF). Leibniz International Proceedings in Informatics. Vol. 25. pp. 675–686. CiteSeerX 10.1.1.742.6691. doi:10.4230/LIPICS.STACS.2014.675. ISBN 978-3-939897-65-1. ISSN 1868-8969. Zbl 1359.68341. Wikidata Q90348192. {{cite book}}: |journal= ignored (help)CS1 maint: unflagged free DOI (link)
Yuta Fujishige; Yuki Tsujimaru; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (2016). Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets (PDF). Vol. 58. pp. 38:1–38:14. doi:10.4230/LIPICS.MFCS.2016.38. ISBN 978-3-95977-016-3. ISSN 1868-8969. Zbl 1398.68703. Wikidata Q90410044. {{cite book}}: |journal= ignored (help)CS1 maint: unflagged free DOI (link)
Mehryar Mohri; Pedro Moreno; Eugene Weinstein (September 2009). "General suffix automaton construction algorithm and space bounds". Theoretical Computer Science. 410 (37): 3553–3562. CiteSeerX 10.1.1.157.7443. doi:10.1016/J.TCS.2009.03.034. ISSN 0304-3975. Zbl 1194.68143. Wikidata Q90410808.
Simone Faro (2016). Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences. Lecture Notes in Computer Science. pp. 145–157. doi:10.1007/978-3-319-38827-4_12. ISBN 978-3-319-38827-4. Wikidata Q90412338. {{cite book}}: |journal= ignored (help)
Maxime Crochemore; Christophe Hancart (1997). Automata for Matching Patterns. Vol. 2. pp. 399–462. CiteSeerX 10.1.1.392.8637. doi:10.1007/978-3-662-07675-0_9. ISBN 978-3-642-59136-5. Wikidata Q90413384. {{cite book}}: |journal= ignored (help)
Maxime Crochemore; Renaud Vérin (1997). On compact directed acyclic word graphs. Lecture Notes in Computer Science. pp. 192–211. CiteSeerX 10.1.1.13.6892. doi:10.1007/3-540-63246-8_12. ISBN 978-3-540-69242-3. Wikidata Q90413885. {{cite book}}: |journal= ignored (help)
Maxime Crochemore; Costas S. Iliopoulos; Gonzalo Navarro; Yoan J. Pinzon (2003). A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval. pp. 211–223. CiteSeerX 10.1.1.8.533. doi:10.1007/978-3-540-39984-1_16. ISBN 978-3-540-39984-1. Wikidata Q90414195. {{cite book}}: |journal= ignored (help)
John Edward Hopcroft; Jeffrey David Ullman (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Massachusetts: Addison-Wesley. ISBN 978-81-7808-347-6. OL 9082218M. Wikidata Q90418603.
Edward R. Fiala; Daniel H. Greene (April 1989). "Data compression with finite windows". Communications of the ACM. 32 (4): 490–505. doi:10.1145/63334.63341. ISSN 0001-0782. Wikidata Q90425560.
Martin Senft; Tomáš Dvořák (2008). Sliding CDAWG Perfection. pp. 109–120. doi:10.1007/978-3-540-89097-3_12. ISBN 978-3-540-89097-3. Wikidata Q90426624. {{cite book}}: |journal= ignored (help)
N. Jesper Larsson (1996). "Extended application of suffix trees to data compression". Proceedings. Data Compression Conference: 190–199. CiteSeerX 10.1.1.12.8623. doi:10.1109/DCC.1996.488324. ISSN 2375-0383. Wikidata Q90427112.
Andrej Brodnik; Matevž Jekovec (3 August 2018). "Sliding Suffix Tree". Algorithms. 11 (8): 118. doi:10.3390/A11080118. ISSN 1999-4893. Zbl 1458.68043. Wikidata Q90431196.{{cite journal}}: CS1 maint: unflagged free DOI (link)
Mikhail Rubinchik; Arseny M. Shur (February 2018). "Eertree: An efficient data structure for processing palindromes in strings" (PDF). European Journal of Combinatorics. 68: 249–265. arXiv:1506.04862. doi:10.1016/J.EJC.2017.07.021. ISSN 0195-6698. Zbl 1374.68131. Wikidata Q90726647.
Vladimir Serebryakov; Maksim Pavlovich Galochkin; Meran Gabibullaevich Furugian; Dmitriy Ruslanovich Gonchar (2006). Теория и реализация языков программирования: Учебное пособие (PDF) (in Russian). Moscow: MZ Press. ISBN 5-94073-094-9. Wikidata Q90432456.
Александр Александрович Рубцов (2019). Заметки и задачи о регулярных языках и конечных автоматах (PDF) (in Russian). Moscow: Moscow Institute of Physics and Technology. ISBN 978-5-7417-0702-9. Wikidata Q90435728.
Дмитрий А. Паращенко (2007), Обработка строк на основе суффиксных автоматов (PDF) (in Russian), Saint Petersburg: ITMO University, Wikidata Q90436837

Example non-Harvard

This is an example.^[1]^[2] Because references are neat or something.^[3]^: 22

^ Peter Weiner (October 1973). "Linear pattern matching algorithms". Symposium on Foundations of Computer Science: 1–11. CiteSeerX 10.1.1.474.9582. doi:10.1109/SWAT.1973.13. Wikidata Q29541479.
^ Vaughan Ronald Pratt (1973), Improvements and applications for the Weiner repetition finder, OCLC 726598262, Wikidata Q90300966
^ Anatoly Olesievich Slisenko (1983). "Detection of periodicities and string-matching in real time". Journal of Mathematical Sciences. 22 (3): 1316–1387. doi:10.1007/BF01084395. ISSN 1072-3374. Zbl 0509.68043. Wikidata Q90305414.

[Weiner-1] Peter Weiner (October 1973). "Linear pattern matching algorithms". Symposium on Foundations of Computer Science: 1–11. CiteSeerX 10.1.1.474.9582. doi:10.1109/SWAT.1973.13. Wikidata Q29541479.

[Pratt-2] Vaughan Ronald Pratt (1973), Improvements and applications for the Weiner repetition finder, OCLC 726598262, Wikidata Q90300966

[Slisenko-3] Anatoly Olesievich Slisenko (1983). "Detection of periodicities and string-matching in real time". Journal of Mathematical Sciences. 22 (3): 1316–1387. doi:10.1007/BF01084395. ISSN 1072-3374. Zbl 0509.68043. Wikidata Q90305414.

[1]

[2]

[3]