iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.uni-trier.de/pid/44/2355.rss
dblp: Hideo Bannai https://dblp.org/pid/44/2355.html dblp person page RSS feed Mon, 07 Oct 2024 22:06:34 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Hideo Bannaihttps://dblp.org/pid/44/2355.html14451 Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences.https://doi.org/10.1007/s00453-023-01125-z, , , , :
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 ()]]>https://dblp.org/rec/journals/algorithmica/BannaiIKKP24Fri, 01 Mar 2024 00:00:00 +0100 Pfp-fm: an accelerated FM-index.https://doi.org/10.1186/s13015-024-00260-8, , , , , :
Pfp-fm: an accelerated FM-index. Algorithms Mol. Biol. 19(1): 15 ()]]>https://dblp.org/rec/journals/almob/HongOKBBG24Sun, 01 Dec 2024 00:00:00 +0100 Constructing and indexing the bijective and extended Burrows-Wheeler transform.https://doi.org/10.1016/j.ic.2024.105153, , , :
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297: 105153 ()]]>https://dblp.org/rec/journals/iandc/BannaiKKP24Mon, 01 Jan 2024 00:00:00 +0100 Faster space-efficient STR-IC-LCS computation.https://doi.org/10.1016/j.tcs.2024.114607, , , :
Faster space-efficient STR-IC-LCS computation. Theor. Comput. Sci. 1003: 114607 ()]]>https://dblp.org/rec/journals/tcs/YonemotoNIB24Mon, 01 Jan 2024 00:00:00 +0100 Maintaining the Size of LZ77 on Semi-Dynamic Strings.https://doi.org/10.4230/LIPIcs.CPM.2024.3, , :
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM : 3:1-3:20]]>https://dblp.org/rec/conf/cpm/BannaiCR24Mon, 01 Jan 2024 00:00:00 +0100 On the Hardness of Smallest RLSLPs and Collage Systems.https://doi.org/10.1109/DCC58796.2024.00032, , , :
On the Hardness of Smallest RLSLPs and Collage Systems. DCC : 243-252]]>https://dblp.org/rec/conf/dcc/KawamotoIKB24Mon, 01 Jan 2024 00:00:00 +0100 Height-Bounded Lempel-Ziv Encodings.https://doi.org/10.4230/LIPIcs.ESA.2024.18, , , , :
Height-Bounded Lempel-Ziv Encodings. ESA : 18:1-18:18]]>https://dblp.org/rec/conf/esa/BannaiFHMP24Mon, 01 Jan 2024 00:00:00 +0100 Computing Maximal Palindromes in Non-standard Matching Models.https://doi.org/10.1007/978-3-031-63021-7_13, , , , , :
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA : 165-179]]>https://dblp.org/rec/conf/iwoca/FunakoshiMNIBT24Mon, 01 Jan 2024 00:00:00 +0100 Edit and Alphabet-Ordering Sensitivity of Lex-Parse.https://doi.org/10.4230/LIPIcs.MFCS.2024.75, , , , :
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS : 75:1-75:15]]>https://dblp.org/rec/conf/mfcs/0001KFIB24Mon, 01 Jan 2024 00:00:00 +0100 Bijective BWT Based Compression Schemes.https://doi.org/10.1007/978-3-031-72200-4_2, , :
Bijective BWT Based Compression Schemes. SPIRE : 16-25]]>https://dblp.org/rec/conf/spire/BadkobehBK24Mon, 01 Jan 2024 00:00:00 +0100 On the Number of Non-equivalent Parameterized Squares in a String.https://doi.org/10.1007/978-3-031-72200-4_13, , , , :
On the Number of Non-equivalent Parameterized Squares in a String. SPIRE : 174-183]]>https://dblp.org/rec/conf/spire/HamaiTNIB24Mon, 01 Jan 2024 00:00:00 +0100 Edit and Alphabet-Ordering Sensitivity of Lex-parse.https://doi.org/10.48550/arXiv.2402.19223, , , , :
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR abs/2402.19223 ()]]>https://dblp.org/rec/journals/corr/abs-2402-19223Mon, 01 Jan 2024 00:00:00 +0100 NP-Completeness for the Space-Optimality of Double-Array Tries.https://doi.org/10.48550/arXiv.2403.04951, , , :
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR abs/2403.04951 ()]]>https://dblp.org/rec/journals/corr/abs-2403-04951Mon, 01 Jan 2024 00:00:00 +0100 Height-bounded Lempel-Ziv encodings.https://doi.org/10.48550/arXiv.2403.08209, , , , :
Height-bounded Lempel-Ziv encodings. CoRR abs/2403.08209 ()]]>https://dblp.org/rec/journals/corr/abs-2403-08209Mon, 01 Jan 2024 00:00:00 +0100 Bijective BWT based compression schemes.https://doi.org/10.48550/arXiv.2406.16475, , :
Bijective BWT based compression schemes. CoRR abs/2406.16475 ()]]>https://dblp.org/rec/journals/corr/abs-2406-16475Mon, 01 Jan 2024 00:00:00 +0100 On the Number of Non-equivalent Parameterized Squares in a String.https://doi.org/10.48550/arXiv.2408.04920, , , , :
On the Number of Non-equivalent Parameterized Squares in a String. CoRR abs/2408.04920 ()]]>https://dblp.org/rec/journals/corr/abs-2408-04920Mon, 01 Jan 2024 00:00:00 +0100 Longest bordered and periodic subsequences.https://doi.org/10.1016/j.ipl.2023.106398, , :
Longest bordered and periodic subsequences. Inf. Process. Lett. 182: 106398 ()]]>https://dblp.org/rec/journals/ipl/BannaiIK23Tue, 01 Aug 2023 01:00:00 +0200 Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets.https://doi.org/10.1016/j.tcs.2023.114093, , , , :
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theor. Comput. Sci. 973: 114093 ()]]>https://dblp.org/rec/journals/tcs/FujishigeTIBT23Fri, 01 Sep 2023 01:00:00 +0200 Optimal LZ-End Parsing Is Hard.https://doi.org/10.4230/LIPIcs.CPM.2023.3, , , , , :
Optimal LZ-End Parsing Is Hard. CPM : 3:1-3:11]]>https://dblp.org/rec/conf/cpm/BannaiFKNSU23Sun, 01 Jan 2023 00:00:00 +0100 Lyndon Arrays in Sublinear Time.https://doi.org/10.4230/LIPIcs.ESA.2023.14, :
Lyndon Arrays in Sublinear Time. ESA : 14:1-14:16]]>https://dblp.org/rec/conf/esa/BannaiE23Sun, 01 Jan 2023 00:00:00 +0100 Space-Efficient STR-IC-LCS Computation.https://doi.org/10.1007/978-3-031-23101-8_25, , , :
Space-Efficient STR-IC-LCS Computation. SOFSEM : 372-384]]>https://dblp.org/rec/conf/sofsem/YonemotoNIB23Sun, 01 Jan 2023 00:00:00 +0100 Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.https://doi.org/10.1007/978-3-031-43980-3_27, , , , :
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE : 331-344]]>https://dblp.org/rec/conf/spire/OkabeMNIB23Sun, 01 Jan 2023 00:00:00 +0100 Acceleration of FM-Index Queries Through Prefix-Free Parsing.https://doi.org/10.4230/LIPIcs.WABI.2023.13, , , , , :
Acceleration of FM-Index Queries Through Prefix-Free Parsing. WABI : 13:1-13:16]]>https://dblp.org/rec/conf/wabi/HongOKBBG23Sun, 01 Jan 2023 00:00:00 +0100 Optimal LZ-End Parsing is Hard.https://doi.org/10.48550/arXiv.2302.02586, , , , , :
Optimal LZ-End Parsing is Hard. CoRR abs/2302.02586 ()]]>https://dblp.org/rec/journals/corr/abs-2302-02586Sun, 01 Jan 2023 00:00:00 +0100 Acceleration of FM-index Queries Through Prefix-free Parsing.https://doi.org/10.48550/arXiv.2305.05893, , , , , :
Acceleration of FM-index Queries Through Prefix-free Parsing. CoRR abs/2305.05893 ()]]>https://dblp.org/rec/journals/corr/abs-2305-05893Sun, 01 Jan 2023 00:00:00 +0100 Sliding suffix trees simplified.https://doi.org/10.48550/arXiv.2307.01412, , , :
Sliding suffix trees simplified. CoRR abs/2307.01412 ()]]>https://dblp.org/rec/journals/corr/abs-2307-01412Sun, 01 Jan 2023 00:00:00 +0100 Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets.https://doi.org/10.48550/arXiv.2307.01428, , , , :
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets. CoRR abs/2307.01428 ()]]>https://dblp.org/rec/journals/corr/abs-2307-01428Sun, 01 Jan 2023 00:00:00 +0100 Linear-time computation of generalized minimal absent words for multiple strings.https://doi.org/10.48550/arXiv.2307.01967, , , , :
Linear-time computation of generalized minimal absent words for multiple strings. CoRR abs/2307.01967 ()]]>https://dblp.org/rec/journals/corr/abs-2307-01967Sun, 01 Jan 2023 00:00:00 +0100 Computing Minimal Unique Substrings for a Sliding Window.https://doi.org/10.1007/s00453-021-00864-1, , , , , :
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84(3): 670-693 ()]]>https://dblp.org/rec/journals/algorithmica/MienoFNIBT22Sat, 01 Jan 2022 00:00:00 +0100 c-trie++: A dynamic trie tailored for fast prefix searches.https://doi.org/10.1016/j.ic.2021.104794, , , , , , :
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285(Part): 104794 ()]]>https://dblp.org/rec/journals/iandc/TsurutaKKNIBT22Sat, 01 Jan 2022 00:00:00 +0100 Order-preserving pattern matching indeterminate strings.https://doi.org/10.1016/j.ic.2022.104924, , , , :
Order-preserving pattern matching indeterminate strings. Inf. Comput. 289(Part): 104924 ()]]>https://dblp.org/rec/journals/iandc/RussoCHBF22Sat, 01 Jan 2022 00:00:00 +0100 Palindromic trees for a sliding window and its applications.https://doi.org/10.1016/j.ipl.2021.106174, , , , , :
Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173: 106174 ()]]>https://dblp.org/rec/journals/ipl/MienoWNIBT22Sat, 01 Jan 2022 00:00:00 +0100 Factorizing Strings into Repetitions.https://doi.org/10.1007/s00224-022-10070-3, , , , , :
Factorizing Strings into Repetitions. Theory Comput. Syst. 66(2): 484-501 ()]]>https://dblp.org/rec/journals/mst/InoueMNIBT22Sat, 01 Jan 2022 00:00:00 +0100 Combinatorics of minimal absent words for a sliding window.https://doi.org/10.1016/j.tcs.2022.06.002, , , , , , :
Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927: 109-119 ()]]>https://dblp.org/rec/journals/tcs/AkagiKMNIBT22Sat, 01 Jan 2022 00:00:00 +0100 Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.https://doi.org/10.1016/j.tcs.2022.09.008, , , , , , , , :
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. 933: 21-42 ()]]>https://dblp.org/rec/journals/tcs/NakashimaFHNYIB22Sat, 01 Jan 2022 00:00:00 +0100 Computing NP-Hard Repetitiveness Measures via MAX-SAT.https://doi.org/10.4230/LIPIcs.ESA.2022.12, , , , , :
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA : 12:1-12:16]]>https://dblp.org/rec/conf/esa/Bannai0IKKN22Sat, 01 Jan 2022 00:00:00 +0100 Computing Longest (Common) Lyndon Subsequences.https://doi.org/10.1007/978-3-031-06678-8_10, , , , :
Computing Longest (Common) Lyndon Subsequences. IWOCA : 128-142]]>https://dblp.org/rec/conf/iwoca/BannaiIKKP22Sat, 01 Jan 2022 00:00:00 +0100 Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.https://doi.org/10.1007/978-3-031-20643-6_3, , , :
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE : 24-37]]>https://dblp.org/rec/conf/spire/LeonardIBM22Sat, 01 Jan 2022 00:00:00 +0100 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic.https://www.dagstuhl.de/dagpub/978-3-95977-234-1, :
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic. LIPIcs 223, Schloss Dagstuhl - Leibniz-Zentrum für Informatik , ISBN 978-3-95977-234-1 [contents]]]>https://dblp.org/rec/conf/cpm/2022Sat, 01 Jan 2022 00:00:00 +0100 Computing Longest (Common) Lyndon Subsequences.https://arxiv.org/abs/2201.06773, , , , :
Computing Longest (Common) Lyndon Subsequences. CoRR abs/2201.06773 ()]]>https://dblp.org/rec/journals/corr/abs-2201-06773Sat, 01 Jan 2022 00:00:00 +0100 Longest (Sub-)Periodic Subsequence.https://arxiv.org/abs/2202.07189, , :
Longest (Sub-)Periodic Subsequence. CoRR abs/2202.07189 ()]]>https://dblp.org/rec/journals/corr/abs-2202-07189Sat, 01 Jan 2022 00:00:00 +0100 Computing NP-hard Repetitiveness Measures via MAX-SAT.https://doi.org/10.48550/arXiv.2207.02571, , , , , :
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR abs/2207.02571 ()]]>https://dblp.org/rec/journals/corr/abs-2207-02571Sat, 01 Jan 2022 00:00:00 +0100 Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions.https://doi.org/10.48550/arXiv.2207.04194, , , :
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR abs/2207.04194 ()]]>https://dblp.org/rec/journals/corr/abs-2207-04194Sat, 01 Jan 2022 00:00:00 +0100 Computing maximal generalized palindromes.https://doi.org/10.48550/arXiv.2210.02067, , , , , :
Computing maximal generalized palindromes. CoRR abs/2210.02067 ()]]>https://dblp.org/rec/journals/corr/abs-2210-02067Sat, 01 Jan 2022 00:00:00 +0100 Space-Efficient STR-IC-LCS Computation.https://doi.org/10.48550/arXiv.2210.07979, , , :
Space-Efficient STR-IC-LCS Computation. CoRR abs/2210.07979 ()]]>https://dblp.org/rec/journals/corr/abs-2210-07979Sat, 01 Jan 2022 00:00:00 +0100 Compressed Communication Complexity of Hamming Distance.https://doi.org/10.3390/a14040116, , , , :
Compressed Communication Complexity of Hamming Distance. Algorithms 14(4): 116 ()]]>https://dblp.org/rec/journals/algorithms/MitsuyaNIBT21Fri, 01 Jan 2021 00:00:00 +0100 Longest previous overlapping factor array.https://doi.org/10.1016/j.ipl.2021.106097, , :
Longest previous overlapping factor array. Inf. Process. Lett. 168: 106097 ()]]>https://dblp.org/rec/journals/ipl/BannaiIM21Fri, 01 Jan 2021 00:00:00 +0100 Computing longest palindromic substring after single-character or block-wise edits.https://doi.org/10.1016/j.tcs.2021.01.014, , , , :
Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859: 116-133 ()]]>https://dblp.org/rec/journals/tcs/FunakoshiNIBT21Fri, 01 Jan 2021 00:00:00 +0100 Efficiently computing runs on a trie.https://doi.org/10.1016/j.tcs.2021.07.011, , , , :
Efficiently computing runs on a trie. Theor. Comput. Sci. 887: 143-151 ()]]>https://dblp.org/rec/journals/tcs/SugaharaNIBT21Fri, 01 Jan 2021 00:00:00 +0100 The Smallest Grammar Problem Revisited.https://doi.org/10.1109/TIT.2020.3038147, , , , , , :
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67(1): 317-328 ()]]>https://dblp.org/rec/journals/tit/BannaiHHIJLR21Fri, 01 Jan 2021 00:00:00 +0100 The Parameterized Suffix Tray.https://doi.org/10.1007/978-3-030-75242-2_18, , , , :
The Parameterized Suffix Tray. CIAC : 258-270]]>https://dblp.org/rec/conf/ciac/FujisatoNIBT21Fri, 01 Jan 2021 00:00:00 +0100 Repetitions in Strings: A "Constant" Problem (Invited Talk).https://doi.org/10.4230/LIPIcs.CPM.2021.1:
Repetitions in Strings: A "Constant" Problem (Invited Talk). CPM : 1:1-1:1]]>https://dblp.org/rec/conf/cpm/Bannai21Fri, 01 Jan 2021 00:00:00 +0100 Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time.https://doi.org/10.4230/LIPIcs.CPM.2021.7, , , :
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM : 7:1-7:16]]>https://dblp.org/rec/conf/cpm/BannaiKKP21Fri, 01 Jan 2021 00:00:00 +0100 Longest Common Rollercoasters.https://doi.org/10.1007/978-3-030-86692-1_3, , , , :
Longest Common Rollercoasters. SPIRE : 21-32]]>https://dblp.org/rec/conf/spire/FujitaNIBT21Fri, 01 Jan 2021 00:00:00 +0100 Grammar Index by Induced Suffix Sorting.https://doi.org/10.1007/978-3-030-86692-1_8, , , , , :
Grammar Index by Induced Suffix Sorting. SPIRE : 85-99]]>https://dblp.org/rec/conf/spire/AkagiKNIBT21Fri, 01 Jan 2021 00:00:00 +0100 A Separation of γ and b via Thue-Morse Words.https://doi.org/10.1007/978-3-030-86692-1_14, , , , , :
A Separation of γ and b via Thue-Morse Words. SPIRE : 167-178]]>https://dblp.org/rec/conf/spire/BannaiFIKMN21Fri, 01 Jan 2021 00:00:00 +0100 Compressed Communication Complexity of Hamming Distance.https://arxiv.org/abs/2103.03468, , , , :
Compressed Communication Complexity of Hamming Distance. CoRR abs/2103.03468 ()]]>https://dblp.org/rec/journals/corr/abs-2103-03468Fri, 01 Jan 2021 00:00:00 +0100 A Separation of γ and b via Thue-Morse Words.https://arxiv.org/abs/2104.09985, , , , , :
A Separation of γ and b via Thue-Morse Words. CoRR abs/2104.09985 ()]]>https://dblp.org/rec/journals/corr/abs-2104-09985Fri, 01 Jan 2021 00:00:00 +0100 Combinatorics of minimal absent words for a sliding window.https://arxiv.org/abs/2105.08496, , , , , , :
Combinatorics of minimal absent words for a sliding window. CoRR abs/2105.08496 ()]]>https://dblp.org/rec/journals/corr/abs-2105-08496Fri, 01 Jan 2021 00:00:00 +0100 Grammar Index By Induced Suffix Sorting.https://arxiv.org/abs/2105.13744, , , , , :
Grammar Index By Induced Suffix Sorting. CoRR abs/2105.13744 ()]]>https://dblp.org/rec/journals/corr/abs-2105-13744Fri, 01 Jan 2021 00:00:00 +0100 Practical Grammar Compression Based on Maximal Repeats.https://doi.org/10.3390/a13040103, , , , , :
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13(4): 103 ()]]>https://dblp.org/rec/journals/algorithms/FuruyaTNIBK20Wed, 01 Jan 2020 00:00:00 +0100 More Time-Space Tradeoffs for Finding a Shortest Unique Substring.https://doi.org/10.3390/a13090234, , , , :
More Time-Space Tradeoffs for Finding a Shortest Unique Substring. Algorithms 13(9): 234 ()]]>https://dblp.org/rec/journals/algorithms/BannaiGHPR20Wed, 01 Jan 2020 00:00:00 +0100 Finding all maximal perfect haplotype blocks in linear time.https://doi.org/10.1186/s13015-020-0163-6, , , , :
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15(1): 2 ()]]>https://dblp.org/rec/journals/almob/AlankoBCPS20Wed, 01 Jan 2020 00:00:00 +0100 Dynamic index and LZ factorization in compressed space.https://doi.org/10.1016/j.dam.2019.01.014, , , , :
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274: 116-129 ()]]>https://dblp.org/rec/journals/dam/NishimotoIIBT20Wed, 01 Jan 2020 00:00:00 +0100 Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.https://doi.org/10.1007/s00224-020-09980-x, , , , :
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. Theory Comput. Syst. 64(7): 1273-1291 ()]]>https://dblp.org/rec/journals/mst/WatanabeNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Refining the r-index.https://doi.org/10.1016/j.tcs.2019.08.005, , :
Refining the r-index. Theor. Comput. Sci. 812: 96-108 ()]]>https://dblp.org/rec/journals/tcs/BannaiGI20Wed, 01 Jan 2020 00:00:00 +0100 Space-efficient algorithms for computing minimal/shortest unique substrings.https://doi.org/10.1016/j.tcs.2020.09.017, , , , , :
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845: 230-242 ()]]>https://dblp.org/rec/journals/tcs/MienoKNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.https://doi.org/10.4230/LIPIcs.CPM.2020.12, , , , , :
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM : 12:1-12:11]]>https://dblp.org/rec/conf/cpm/FunakoshiNIBTS20Wed, 01 Jan 2020 00:00:00 +0100 DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.https://doi.org/10.4230/LIPIcs.CPM.2020.26, , , , , , , , :
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM : 26:1-26:14]]>https://dblp.org/rec/conf/cpm/NakashimaFHNYIB20Wed, 01 Jan 2020 00:00:00 +0100 c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches.https://doi.org/10.1109/DCC47342.2020.00032, , , , , , :
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC : 243-252]]>https://dblp.org/rec/conf/dcc/TsurutaKKNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Faster STR-EC-LCS Computation.https://doi.org/10.1007/978-3-030-38919-2_11, , , , :
Faster STR-EC-LCS Computation. SOFSEM : 125-135]]>https://dblp.org/rec/conf/sofsem/YamadaNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.https://doi.org/10.1007/978-3-030-38919-2_13, , , , , , , :
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. SOFSEM : 148-160]]>https://dblp.org/rec/conf/sofsem/MienoKAFNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Towards Efficient Interactive Computation of Dynamic Time Warping Distance.https://doi.org/10.1007/978-3-030-59212-7_3, , , , :
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE : 27-41]]>https://dblp.org/rec/conf/spire/NishiNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Longest Square Subsequence Problem Revisited.https://doi.org/10.1007/978-3-030-59212-7_11, , :
Longest Square Subsequence Problem Revisited. SPIRE : 147-154]]>https://dblp.org/rec/conf/spire/InoueIB20Wed, 01 Jan 2020 00:00:00 +0100 On Repetitiveness Measures of Thue-Morse Words.https://doi.org/10.1007/978-3-030-59212-7_15, , , , , :
On Repetitiveness Measures of Thue-Morse Words. SPIRE : 213-220]]>https://dblp.org/rec/conf/spire/KutsukakeMNIBT20Wed, 01 Jan 2020 00:00:00 +0100 Lyndon Words, the Three Squares Lemma, and Primitive Squares.https://doi.org/10.1007/978-3-030-59212-7_19, , :
Lyndon Words, the Three Squares Lemma, and Primitive Squares. SPIRE : 265-273]]>https://dblp.org/rec/conf/spire/BannaiMN20Wed, 01 Jan 2020 00:00:00 +0100 Faster STR-EC-LCS Computation.https://arxiv.org/abs/2001.05671, , , , :
Faster STR-EC-LCS Computation. CoRR abs/2001.05671 ()]]>https://dblp.org/rec/journals/corr/abs-2001-05671Wed, 01 Jan 2020 00:00:00 +0100 DAWGs for parameterized matching: online construction and related indexing structures.https://arxiv.org/abs/2002.06786, , , , , , , , :
DAWGs for parameterized matching: online construction and related indexing structures. CoRR abs/2002.06786 ()]]>https://dblp.org/rec/journals/corr/abs-2002-06786Wed, 01 Jan 2020 00:00:00 +0100 Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.https://arxiv.org/abs/2002.06796, , , , , :
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR abs/2002.06796 ()]]>https://dblp.org/rec/journals/corr/abs-2002-06796Wed, 01 Jan 2020 00:00:00 +0100 Grammar-compressed Self-index with Lyndon Words.https://arxiv.org/abs/2004.05309, , , , , :
Grammar-compressed Self-index with Lyndon Words. CoRR abs/2004.05309 ()]]>https://dblp.org/rec/journals/corr/abs-2004-05309Wed, 01 Jan 2020 00:00:00 +0100 Towards Efficient Interactive Computation of Dynamic Time Warping Distance.https://arxiv.org/abs/2005.08190, , , , :
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR abs/2005.08190 ()]]>https://dblp.org/rec/journals/corr/abs-2005-08190Wed, 01 Jan 2020 00:00:00 +0100 On repetitiveness measures of Thue-Morse words.https://arxiv.org/abs/2005.09524, , , , , :
On repetitiveness measures of Thue-Morse words. CoRR abs/2005.09524 ()]]>https://dblp.org/rec/journals/corr/abs-2005-09524Wed, 01 Jan 2020 00:00:00 +0100 Longest Square Subsequence Problem Revisited.https://arxiv.org/abs/2006.00216, , :
Longest Square Subsequence Problem Revisited. CoRR abs/2006.00216 ()]]>https://dblp.org/rec/journals/corr/abs-2006-00216Wed, 01 Jan 2020 00:00:00 +0100 Computing Palindromic Trees for a Sliding Window and Its Applications.https://arxiv.org/abs/2006.02134, , , , , :
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR abs/2006.02134 ()]]>https://dblp.org/rec/journals/corr/abs-2006-02134Wed, 01 Jan 2020 00:00:00 +0100 Lyndon Words, the Three Squares Lemma, and Primitive Squares.https://arxiv.org/abs/2006.13576, , :
Lyndon Words, the Three Squares Lemma, and Primitive Squares. CoRR abs/2006.13576 ()]]>https://dblp.org/rec/journals/corr/abs-2006-13576Wed, 01 Jan 2020 00:00:00 +0100 The Parameterized Suffix Tray.https://arxiv.org/abs/2012.10092, , , , :
The Parameterized Suffix Tray. CoRR abs/2012.10092 ()]]>https://dblp.org/rec/journals/corr/abs-2012-10092Wed, 01 Jan 2020 00:00:00 +0100 On the size of the smallest alphabet for Lyndon trees.https://doi.org/10.1016/j.tcs.2018.06.044, , , , :
On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. 792: 131-143 ()]]>https://dblp.org/rec/journals/tcs/NakashimaTIBT19Tue, 01 Jan 2019 00:00:00 +0100 The Parameterized Position Heap of a Trie.https://doi.org/10.1007/978-3-030-17402-6_20, , , , :
The Parameterized Position Heap of a Trie. CIAC : 237-248]]>https://dblp.org/rec/conf/ciac/FujisatoNIBT19Tue, 01 Jan 2019 00:00:00 +0100 Indexing the Bijective BWT.https://doi.org/10.4230/LIPIcs.CPM.2019.17, , , :
Indexing the Bijective BWT. CPM : 17:1-17:14]]>https://dblp.org/rec/conf/cpm/BannaiKKP19Tue, 01 Jan 2019 00:00:00 +0100 Computing Runs on a Trie.https://doi.org/10.4230/LIPIcs.CPM.2019.23, , , , :
Computing Runs on a Trie. CPM : 23:1-23:11]]>https://dblp.org/rec/conf/cpm/SugaharaNIBT19Tue, 01 Jan 2019 00:00:00 +0100 Faster Queries for Longest Substring Palindrome After Block Edit.https://doi.org/10.4230/LIPIcs.CPM.2019.27, , , , :
Faster Queries for Longest Substring Palindrome After Block Edit. CPM : 27:1-27:13]]>https://dblp.org/rec/conf/cpm/FunakoshiNIBT19Tue, 01 Jan 2019 00:00:00 +0100 On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.https://doi.org/10.4230/LIPIcs.CPM.2019.29, , , , :
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. CPM : 29:1-29:11]]>https://dblp.org/rec/conf/cpm/UrabeNIBT19Tue, 01 Jan 2019 00:00:00 +0100 MR-RePair: Grammar Compression Based on Maximal Repeats.https://doi.org/10.1109/DCC.2019.00059, , , , , :
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC : 508-517]]>https://dblp.org/rec/conf/dcc/FuruyaTNIBK19Tue, 01 Jan 2019 00:00:00 +0100 An Improved Data Structure for Left-Right Maximal Generic Words Problem.https://doi.org/10.4230/LIPIcs.ISAAC.2019.40, , , , :
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC : 40:1-40:12]]>https://dblp.org/rec/conf/isaac/FujishigeNIBT19Tue, 01 Jan 2019 00:00:00 +0100 Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.https://doi.org/10.1007/978-3-030-25005-8_35, , , , :
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA : 430-441]]>https://dblp.org/rec/conf/iwoca/WatanabeNIBT19Tue, 01 Jan 2019 00:00:00 +0100 Compact Data Structures for Shortest Unique Substring Queries.https://doi.org/10.1007/978-3-030-32686-9_8, , , , , :
Compact Data Structures for Shortest Unique Substring Queries. SPIRE : 107-123]]>https://dblp.org/rec/conf/spire/MienoKNIBT19Tue, 01 Jan 2019 00:00:00 +0100 On Longest Common Property Preserved Substring Queries.https://doi.org/10.1007/978-3-030-32686-9_12, , , , , :
On Longest Common Property Preserved Substring Queries. SPIRE : 162-174]]>https://dblp.org/rec/conf/spire/KaiNIBTK19Tue, 01 Jan 2019 00:00:00 +0100 Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.https://doi.org/10.1007/978-3-030-32686-9_27, , , , :
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. SPIRE : 382-391]]>https://dblp.org/rec/conf/spire/FujisatoNIBT19Tue, 01 Jan 2019 00:00:00 +0100 Computing Maximal Palindromes and Distinct Palindromes in a Trie.http://www.stringology.org/event/2019/p02.html, , , , :
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology : 3-15]]>https://dblp.org/rec/conf/stringology/FunakoshiNIBT19Tue, 01 Jan 2019 00:00:00 +0100 k-Abelian Pattern Matching: Revisited, Corrected, and Extended.http://www.stringology.org/event/2019/p04.html, , , , , :
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology : 29-40]]>https://dblp.org/rec/conf/stringology/BadkobehBCIIS19Tue, 01 Jan 2019 00:00:00 +0100 Finding All Maximal Perfect Haplotype Blocks in Linear Time.https://doi.org/10.4230/LIPIcs.WABI.2019.8, , , , :
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI : 8:1-8:9]]>https://dblp.org/rec/conf/wabi/AlankoBCPS19Tue, 01 Jan 2019 00:00:00 +0100 Computing runs on a trie.http://arxiv.org/abs/1901.10633, , , , :
Computing runs on a trie. CoRR abs/1901.10633 ()]]>https://dblp.org/rec/journals/corr/abs-1901-10633Tue, 01 Jan 2019 00:00:00 +0100 Faster queries for longest substring palindrome after block edit.http://arxiv.org/abs/1901.10722, , , , :
Faster queries for longest substring palindrome after block edit. CoRR abs/1901.10722 ()]]>https://dblp.org/rec/journals/corr/abs-1901-10722Tue, 01 Jan 2019 00:00:00 +0100 The Parameterized Position Heap of a Trie.http://arxiv.org/abs/1903.06289, , , , :
The Parameterized Position Heap of a Trie. CoRR abs/1903.06289 ()]]>https://dblp.org/rec/journals/corr/abs-1903-06289Tue, 01 Jan 2019 00:00:00 +0100 Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.http://arxiv.org/abs/1903.06290, , , , :
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. CoRR abs/1903.06290 ()]]>https://dblp.org/rec/journals/corr/abs-1903-06290Tue, 01 Jan 2019 00:00:00 +0100 Dynamic Packed Compact Tries Revisited.http://arxiv.org/abs/1904.07467, , , , , , :
Dynamic Packed Compact Tries Revisited. CoRR abs/1904.07467 ()]]>https://dblp.org/rec/journals/corr/abs-1904-07467Tue, 01 Jan 2019 00:00:00 +0100 Order-Preserving Pattern Matching Indeterminate Strings.http://arxiv.org/abs/1905.02589, , , , :
Order-Preserving Pattern Matching Indeterminate Strings. CoRR abs/1905.02589 ()]]>https://dblp.org/rec/journals/corr/abs-1905-02589Tue, 01 Jan 2019 00:00:00 +0100 Compact Data Structures for Shortest Unique Substring Queries.http://arxiv.org/abs/1905.12854, , , , , :
Compact Data Structures for Shortest Unique Substring Queries. CoRR abs/1905.12854 ()]]>https://dblp.org/rec/journals/corr/abs-1905-12854Tue, 01 Jan 2019 00:00:00 +0100 Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.http://arxiv.org/abs/1906.00563, , , , :
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. CoRR abs/1906.00563 ()]]>https://dblp.org/rec/journals/corr/abs-1906-00563Tue, 01 Jan 2019 00:00:00 +0100 On Longest Common Property Preserved Substring Queries.http://arxiv.org/abs/1906.05486, , , , , :
On Longest Common Property Preserved Substring Queries. CoRR abs/1906.05486 ()]]>https://dblp.org/rec/journals/corr/abs-1906-05486Tue, 01 Jan 2019 00:00:00 +0100 The smallest grammar problem revisited.http://arxiv.org/abs/1908.06428, , , , , , :
The smallest grammar problem revisited. CoRR abs/1908.06428 ()]]>https://dblp.org/rec/journals/corr/abs-1908-06428Tue, 01 Jan 2019 00:00:00 +0100 Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.http://arxiv.org/abs/1909.02804, , , , , , , :
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. CoRR abs/1909.02804 ()]]>https://dblp.org/rec/journals/corr/abs-1909-02804Tue, 01 Jan 2019 00:00:00 +0100 Constructing the Bijective BWT.http://arxiv.org/abs/1911.06985, , , :
Constructing the Bijective BWT. CoRR abs/1911.06985 ()]]>https://dblp.org/rec/journals/corr/abs-1911-06985Tue, 01 Jan 2019 00:00:00 +0100 Diverse Palindromic Factorization is NP-Complete.https://doi.org/10.1142/S0129054118400014, , , , , , :
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 ()]]>https://dblp.org/rec/journals/ijfcs/BannaiGIKKPS18Mon, 01 Jan 2018 00:00:00 +0100 Algorithms and combinatorial properties on shortest unique palindromic substrings.https://doi.org/10.1016/j.jda.2018.11.009, , , , , :
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52-53: 122-132 ()]]>https://dblp.org/rec/journals/jda/InoueNMIBT18Mon, 01 Jan 2018 00:00:00 +0100 Order-Preserving Pattern Matching Indeterminate Strings.https://doi.org/10.4230/LIPIcs.CPM.2018.2, , , :
Order-Preserving Pattern Matching Indeterminate Strings. CPM : 2:1-2:15]]>https://dblp.org/rec/conf/cpm/HenriquesFRB18Mon, 01 Jan 2018 00:00:00 +0100 Online LZ77 Parsing and Matching Statistics with RLBWTs.https://doi.org/10.4230/LIPIcs.CPM.2018.7, , :
Online LZ77 Parsing and Matching Statistics with RLBWTs. CPM : 7:1-7:12]]>https://dblp.org/rec/conf/cpm/BannaiGI18Mon, 01 Jan 2018 00:00:00 +0100 Faster Online Elastic Degenerate String Matching.https://doi.org/10.4230/LIPIcs.CPM.2018.9, , , , , :
Faster Online Elastic Degenerate String Matching. CPM : 9:1-9:10]]>https://dblp.org/rec/conf/cpm/AoyamaNIIBT18Mon, 01 Jan 2018 00:00:00 +0100 Longest substring palindrome after edit.https://doi.org/10.4230/LIPIcs.CPM.2018.12, , , , :
Longest substring palindrome after edit. CPM : 12:1-12:14]]>https://dblp.org/rec/conf/cpm/FunakoshiNIBT18Mon, 01 Jan 2018 00:00:00 +0100 Computing longest common square subsequences.https://doi.org/10.4230/LIPIcs.CPM.2018.15, , , , :
Computing longest common square subsequences. CPM : 15:1-15:13]]>https://dblp.org/rec/conf/cpm/InoueIHBT18Mon, 01 Jan 2018 00:00:00 +0100 Longest Lyndon Substring After Edit.https://doi.org/10.4230/LIPIcs.CPM.2018.19, , , , :
Longest Lyndon Substring After Edit. CPM : 19:1-19:10]]>https://dblp.org/rec/conf/cpm/UrabeNIBT18Mon, 01 Jan 2018 00:00:00 +0100 Lyndon Factorization of Grammar Compressed Texts Revisited.https://doi.org/10.4230/LIPIcs.CPM.2018.24, , , , , :
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM : 24:1-24:10]]>https://dblp.org/rec/conf/cpm/FuruyaNIIBT18Mon, 01 Jan 2018 00:00:00 +0100 Block Palindromes: A New Generalization of Palindromes.https://doi.org/10.1007/978-3-030-00479-8_15, , , :
Block Palindromes: A New Generalization of Palindromes. SPIRE : 183-190]]>https://dblp.org/rec/conf/spire/GotoIBI18Mon, 01 Jan 2018 00:00:00 +0100 Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.https://doi.org/10.1007/978-3-030-00479-8_21, , , , :
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. SPIRE : 254-267]]>https://dblp.org/rec/conf/spire/KuharaNIBT18Mon, 01 Jan 2018 00:00:00 +0100 O(n log n)-time Text Compression by LZ-style Longest First Substitution.http://www.stringology.org/event/2018/p03.html, , , , :
O(n log n)-time Text Compression by LZ-style Longest First Substitution. Stringology : 12-26]]>https://dblp.org/rec/conf/stringology/NishiNIBT18Mon, 01 Jan 2018 00:00:00 +0100 Right-to-left Online Construction of Parameterized Position Heaps.http://www.stringology.org/event/2018/p09.html, , , , :
Right-to-left Online Construction of Parameterized Position Heaps. Stringology : 91-102]]>https://dblp.org/rec/conf/stringology/FujisatoNIBT18Mon, 01 Jan 2018 00:00:00 +0100 Online LZ77 Parsing and Matching Statistics with RLBWTs.http://arxiv.org/abs/1802.05906, , :
Online LZ77 Parsing and Matching Statistics with RLBWTs. CoRR abs/1802.05906 ()]]>https://dblp.org/rec/journals/corr/abs-1802-05906Mon, 01 Jan 2018 00:00:00 +0100 Block Palindromes: A New Generalization of Palindromes.http://arxiv.org/abs/1806.00198, , , :
Block Palindromes: A New Generalization of Palindromes. CoRR abs/1806.00198 ()]]>https://dblp.org/rec/journals/corr/abs-1806-00198Mon, 01 Jan 2018 00:00:00 +0100 O(n log n)-time text compression by LZ-style longest first substitution.http://arxiv.org/abs/1806.04890, , , , :
O(n log n)-time text compression by LZ-style longest first substitution. CoRR abs/1806.04890 ()]]>https://dblp.org/rec/journals/corr/abs-1806-04890Mon, 01 Jan 2018 00:00:00 +0100 Right-to-left online construction of parameterized position heaps.http://arxiv.org/abs/1808.01071, , , , :
Right-to-left online construction of parameterized position heaps. CoRR abs/1808.01071 ()]]>https://dblp.org/rec/journals/corr/abs-1808-01071Mon, 01 Jan 2018 00:00:00 +0100 MR-RePair: Grammar Compression based on Maximal Repeats.http://arxiv.org/abs/1811.04596, , , , , :
MR-RePair: Grammar Compression based on Maximal Repeats. CoRR abs/1811.04596 ()]]>https://dblp.org/rec/journals/corr/abs-1811-04596Mon, 01 Jan 2018 00:00:00 +0100 Efficient Computation of Substring Equivalence Classes with Suffix Arrays.https://doi.org/10.1007/s00453-016-0178-z, , , , :
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Algorithmica 79(2): 291-318 ()]]>https://dblp.org/rec/journals/algorithmica/NarisawaHIBT17Sun, 01 Jan 2017 00:00:00 +0100 The "Runs" Theorem.https://doi.org/10.1137/15M1011032, , , , , :
The "Runs" Theorem. SIAM J. Comput. 46(5): 1501-1514 ()]]>https://dblp.org/rec/journals/siamcomp/BannaiIINTT17Sun, 01 Jan 2017 00:00:00 +0100 Inferring strings from Lyndon factorization.https://doi.org/10.1016/j.tcs.2017.05.038, , , , , :
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689: 147-156 ()]]>https://dblp.org/rec/journals/tcs/NakashimaOIIBT17Sun, 01 Jan 2017 00:00:00 +0100 Faster STR-IC-LCS Computation via RLE.https://doi.org/10.4230/LIPIcs.CPM.2017.20, , , , :
Faster STR-IC-LCS Computation via RLE. CPM : 20:1-20:12]]>https://dblp.org/rec/conf/cpm/KuboiFIBT17Sun, 01 Jan 2017 00:00:00 +0100 Computing All Distinct Squares in Linear Time for Integer Alphabets.https://doi.org/10.4230/LIPIcs.CPM.2017.22, , :
Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM : 22:1-22:18]]>https://dblp.org/rec/conf/cpm/BannaiIK17Sun, 01 Jan 2017 00:00:00 +0100 Tight Bounds on the Maximum Number of Shortest Unique Substrings.https://doi.org/10.4230/LIPIcs.CPM.2017.24, , , :
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM : 24:1-24:11]]>https://dblp.org/rec/conf/cpm/MienoIBT17Sun, 01 Jan 2017 00:00:00 +0100 Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.https://doi.org/10.4230/LIPIcs.ISAAC.2017.33, , , , :
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. ISAAC : 33:1-33:12]]>https://dblp.org/rec/conf/isaac/FujishigeNIBT17Sun, 01 Jan 2017 00:00:00 +0100 Shortest Unique Palindromic Substring Queries in Optimal Time.https://doi.org/10.1007/978-3-319-78825-8_32, , , , , :
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA : 397-408]]>https://dblp.org/rec/conf/iwoca/NakashimaIMIBT17Sun, 01 Jan 2017 00:00:00 +0100 Computing Abelian String Regularities Based on RLE.https://doi.org/10.1007/978-3-319-78825-8_34, , , , :
Computing Abelian String Regularities Based on RLE. IWOCA : 420-431]]>https://dblp.org/rec/conf/iwoca/SugimotoNIBT17Sun, 01 Jan 2017 00:00:00 +0100 Small-Space LCE Data Structure with Constant-Time Queries.https://doi.org/10.4230/LIPIcs.MFCS.2017.10, , , , :
Small-Space LCE Data Structure with Constant-Time Queries. MFCS : 10:1-10:15]]>https://dblp.org/rec/conf/mfcs/TanimuraNBIT17Sun, 01 Jan 2017 00:00:00 +0100 Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.https://doi.org/10.1007/978-3-319-51963-0_28, , , , , , , , :
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. SOFSEM : 363-374]]>https://dblp.org/rec/conf/sofsem/UekiDKMNYBIS17Sun, 01 Jan 2017 00:00:00 +0100 Order Preserving Pattern Matching on Trees and DAGs.https://doi.org/10.1007/978-3-319-67428-5_23, , , :
Order Preserving Pattern Matching on Trees and DAGs. SPIRE : 271-277]]>https://dblp.org/rec/conf/spire/NakamuraIBT17Sun, 01 Jan 2017 00:00:00 +0100 On Reverse Engineering the Lyndon Tree.http://www.stringology.org/event/2017/p11.html, , , , :
On Reverse Engineering the Lyndon Tree. Stringology : 108-117]]>https://dblp.org/rec/conf/stringology/NakashimaTIBT17Sun, 01 Jan 2017 00:00:00 +0100 Computing Abelian regularities on RLE strings.http://arxiv.org/abs/1701.02836, , , , :
Computing Abelian regularities on RLE strings. CoRR abs/1701.02836 ()]]>https://dblp.org/rec/journals/corr/SugimotoNIBT17Sun, 01 Jan 2017 00:00:00 +0100 Small-space encoding LCE data structure with constant-time queries.http://arxiv.org/abs/1702.07458, , , , :
Small-space encoding LCE data structure with constant-time queries. CoRR abs/1702.07458 ()]]>https://dblp.org/rec/journals/corr/TanimuraNBIT17Sun, 01 Jan 2017 00:00:00 +0100 Faster STR-IC-LCS computation via RLE.http://arxiv.org/abs/1703.04954, , , , :
Faster STR-IC-LCS computation via RLE. CoRR abs/1703.04954 ()]]>https://dblp.org/rec/journals/corr/KuboiFIBT17Sun, 01 Jan 2017 00:00:00 +0100 Order preserving pattern matching on trees and DAGs.http://arxiv.org/abs/1706.00148, , , :
Order preserving pattern matching on trees and DAGs. CoRR abs/1706.00148 ()]]>https://dblp.org/rec/journals/corr/NakamuraIBT17Sun, 01 Jan 2017 00:00:00 +0100 Closed factorization.https://doi.org/10.1016/j.dam.2016.04.009, , , , , , , :
Closed factorization. Discret. Appl. Math. 212: 23-29 ()]]>https://dblp.org/rec/journals/dam/BadkobehBGIIIPS16Fri, 01 Jan 2016 00:00:00 +0100 Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.https://doi.org/10.1016/j.tcs.2016.03.005, , , , :
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656: 215-224 ()]]>https://dblp.org/rec/journals/tcs/INIBT16Fri, 01 Jan 2016 00:00:00 +0100 Generalized pattern matching and periodicity under substring consistent equivalence relations.https://doi.org/10.1016/j.tcs.2016.02.017, , , , :
Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656: 225-233 ()]]>https://dblp.org/rec/journals/tcs/MatsuokaAIBT16Fri, 01 Jan 2016 00:00:00 +0100 Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.https://doi.org/10.4230/LIPIcs.CPM.2016.1, , , , , :
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. CPM : 1:1-1:10]]>https://dblp.org/rec/conf/cpm/TanimuraIBIPT16Fri, 01 Jan 2016 00:00:00 +0100 Factorizing a String into Squares in Linear Time.https://doi.org/10.4230/LIPIcs.CPM.2016.27, , , , :
Factorizing a String into Squares in Linear Time. CPM : 27:1-27:12]]>https://dblp.org/rec/conf/cpm/MatsuokaIBTM16Fri, 01 Jan 2016 00:00:00 +0100 Finding Gapped Palindromes Online.https://doi.org/10.1007/978-3-319-44543-4_15, , , , :
Finding Gapped Palindromes Online. IWOCA : 191-202]]>https://dblp.org/rec/conf/iwoca/FujishigeNIBT16Fri, 01 Jan 2016 00:00:00 +0100 Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets.https://doi.org/10.4230/LIPIcs.MFCS.2016.38, , , , :
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. MFCS : 38:1-38:14]]>https://dblp.org/rec/conf/mfcs/FujishigeTIBT16Fri, 01 Jan 2016 00:00:00 +0100 Shortest Unique Substring Queries on Run-Length Encoded Strings.https://doi.org/10.4230/LIPIcs.MFCS.2016.69, , , :
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS : 69:1-69:11]]>https://dblp.org/rec/conf/mfcs/MienoIBT16Fri, 01 Jan 2016 00:00:00 +0100 Fully Dynamic Data Structure for LCE Queries in Compressed Space.https://doi.org/10.4230/LIPIcs.MFCS.2016.72, , , , :
Fully Dynamic Data Structure for LCE Queries in Compressed Space. MFCS : 72:1-72:15]]>https://dblp.org/rec/conf/mfcs/NishimotoIIBT16Fri, 01 Jan 2016 00:00:00 +0100 Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.http://www.stringology.org/event/2016/p12.html, , , , , :
Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. Stringology : 135-145]]>https://dblp.org/rec/conf/stringology/InoueMNIBT16Fri, 01 Jan 2016 00:00:00 +0100 Dynamic Index and LZ Factorization in Compressed Space.http://www.stringology.org/event/2016/p14.html, , , , :
Dynamic Index and LZ Factorization in Compressed Space. Stringology : 158-170]]>https://dblp.org/rec/conf/stringology/NishimotoIIBT16Fri, 01 Jan 2016 00:00:00 +0100 Grammar Compression.https://doi.org/10.1007/978-1-4939-2864-4_635:
Grammar Compression. Encyclopedia of Algorithms : 861-866]]>https://dblp.org/rec/reference/algo/Bannai16Fri, 01 Jan 2016 00:00:00 +0100 Deterministic sub-linear space LCE data structures with efficient construction.http://arxiv.org/abs/1601.07670, , , , , :
Deterministic sub-linear space LCE data structures with efficient construction. CoRR abs/1601.07670 ()]]>https://dblp.org/rec/journals/corr/TanimuraIBIPT16Fri, 01 Jan 2016 00:00:00 +0100 Fully dynamic data structure for LCE queries in compressed space.http://arxiv.org/abs/1605.01488, , , , :
Fully dynamic data structure for LCE queries in compressed space. CoRR abs/1605.01488 ()]]>https://dblp.org/rec/journals/corr/NishimotoIIBT16Fri, 01 Jan 2016 00:00:00 +0100 Dynamic index and LZ factorization in compressed space.http://arxiv.org/abs/1605.09558, , , , :
Dynamic index and LZ factorization in compressed space. CoRR abs/1605.09558 ()]]>https://dblp.org/rec/journals/corr/NishimotoIIBT16aFri, 01 Jan 2016 00:00:00 +0100 Shortest unique palindromic substring queries in optimal time.http://arxiv.org/abs/1608.05550, , , , , :
Shortest unique palindromic substring queries in optimal time. CoRR abs/1608.05550 ()]]>https://dblp.org/rec/journals/corr/NakashimaIMIBT16Fri, 01 Jan 2016 00:00:00 +0100 Longest Common Subsequence in at Least k Length Order-isomorphic Substrings.http://arxiv.org/abs/1609.03668, , , , , , , , :
Longest Common Subsequence in at Least k Length Order-isomorphic Substrings. CoRR abs/1609.03668 ()]]>https://dblp.org/rec/journals/corr/UekiDKMNYBIS16Fri, 01 Jan 2016 00:00:00 +0100 Tight bound on the maximum number of shortest unique substrings.http://arxiv.org/abs/1609.07220, , , :
Tight bound on the maximum number of shortest unique substrings. CoRR abs/1609.07220 ()]]>https://dblp.org/rec/journals/corr/MienoIBT16Fri, 01 Jan 2016 00:00:00 +0100 Computing All Distinct Squares in Linear Time for Integer Alphabets.http://arxiv.org/abs/1610.03421, , :
Computing All Distinct Squares in Linear Time for Integer Alphabets. CoRR abs/1610.03421 ()]]>https://dblp.org/rec/journals/corr/BannaiIK16Fri, 01 Jan 2016 00:00:00 +0100 Detecting regularities on grammar-compressed strings.https://doi.org/10.1016/j.ic.2014.09.009, , , , , , , :
Detecting regularities on grammar-compressed strings. Inf. Comput. 240: 74-89 ()]]>https://dblp.org/rec/journals/iandc/IMSIBTNS15Thu, 01 Jan 2015 00:00:00 +0100 Constructing LZ78 tries and position heaps in linear time for large alphabets.https://doi.org/10.1016/j.ipl.2015.04.002, , , , :
Constructing LZ78 tries and position heaps in linear time for large alphabets. Inf. Process. Lett. 115(9): 655-659 ()]]>https://dblp.org/rec/journals/ipl/NakashimaIIBT15Thu, 01 Jan 2015 00:00:00 +0100 Editorial.https://doi.org/10.1016/j.jda.2015.05.008, :
Editorial. J. Discrete Algorithms 34: 1 ()]]>https://dblp.org/rec/journals/jda/BannaiP15Thu, 01 Jan 2015 00:00:00 +0100 Compressed automata for dictionary matching.https://doi.org/10.1016/j.tcs.2015.01.019, , , , :
Compressed automata for dictionary matching. Theor. Comput. Sci. 578: 30-41 ()]]>https://dblp.org/rec/journals/tcs/INIBT15Thu, 01 Jan 2015 00:00:00 +0100 An Opportunistic Text Indexing Structure Based on Run Length Encoding.https://doi.org/10.1007/978-3-319-18173-8_29, , , , :
An Opportunistic Text Indexing Structure Based on Run Length Encoding. CIAC : 390-402]]>https://dblp.org/rec/conf/ciac/TamakoshiGIBT15Thu, 01 Jan 2015 00:00:00 +0100 LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding.https://doi.org/10.1007/978-3-319-19929-0_19, , , :
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. CPM : 219-230]]>https://dblp.org/rec/conf/cpm/GotoBIT15Thu, 01 Jan 2015 00:00:00 +0100 Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.https://doi.org/10.1007/978-3-319-19929-0_30, , , , :
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. CPM : 355-366]]>https://dblp.org/rec/conf/cpm/MatsuokaIIBT15Thu, 01 Jan 2015 00:00:00 +0100 Diverse Palindromic Factorization Is NP-complete.https://doi.org/10.1007/978-3-319-21500-6_6, , , , , , , :
Diverse Palindromic Factorization Is NP-complete. DLT : 85-96]]>https://dblp.org/rec/conf/dlt/BannaiGIKKPPS15Thu, 01 Jan 2015 00:00:00 +0100 Inferring Strings from Full Abelian Periods.https://doi.org/10.1007/978-3-662-48971-0_64, , , , :
Inferring Strings from Full Abelian Periods. ISAAC : 768-779]]>https://dblp.org/rec/conf/isaac/NishidaIIBT15Thu, 01 Jan 2015 00:00:00 +0100 A new characterization of maximal repetitions by Lyndon trees.https://doi.org/10.1137/1.9781611973730.38, , , , , :
A new characterization of maximal repetitions by Lyndon trees. SODA : 562-571]]>https://dblp.org/rec/conf/soda/BannaiIINTT15Thu, 01 Jan 2015 00:00:00 +0100 Efficient Algorithms for Longest Closed Factor Array.https://doi.org/10.1007/978-3-319-23826-5_10, , , , , , , :
Efficient Algorithms for Longest Closed Factor Array. SPIRE : 95-102]]>https://dblp.org/rec/conf/spire/BannaiIKLRRSW15Thu, 01 Jan 2015 00:00:00 +0100 A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.https://doi.org/10.1007/978-3-319-23826-5_13, , , , , :
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. SPIRE : 124-136]]>https://dblp.org/rec/conf/spire/TanimuraFIIBT15Thu, 01 Jan 2015 00:00:00 +0100 Computing Left-Right Maximal Generic Words.http://www.stringology.org/event/2015/p02.html, , , , :
Computing Left-Right Maximal Generic Words. Stringology : 5-16]]>https://dblp.org/rec/conf/stringology/NishimotoNIBT15Thu, 01 Jan 2015 00:00:00 +0100 Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.http://arxiv.org/abs/1501.06619, , , , :
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. CoRR abs/1501.06619 ()]]>https://dblp.org/rec/journals/corr/NakashimaIIBT15Thu, 01 Jan 2015 00:00:00 +0100 Dynamic index, LZ factorization, and LCE queries in compressed space.http://arxiv.org/abs/1504.06954, , , , :
Dynamic index, LZ factorization, and LCE queries in compressed space. CoRR abs/1504.06954 ()]]>https://dblp.org/rec/journals/corr/NishimotoIIBT15Thu, 01 Jan 2015 00:00:00 +0100 Inferring strings from suffix trees and links on a binary alphabet.https://doi.org/10.1016/j.dam.2013.02.033, , , :
Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. 163: 316-325 ()]]>https://dblp.org/rec/journals/dam/IIBT14Wed, 01 Jan 2014 00:00:00 +0100 On the existence of tight relative 2-designs on binary Hamming association schemes.https://doi.org/10.1016/j.disc.2013.09.013, , :
On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314: 17-37 ()]]>https://dblp.org/rec/journals/dm/BannaiBB14Wed, 01 Jan 2014 00:00:00 +0100 Computing Palindromic Factorizations and Palindromic Covers On-line.https://doi.org/10.1007/978-3-319-07566-2_16, , , , :
Computing Palindromic Factorizations and Palindromic Covers On-line. CPM : 150-161]]>https://dblp.org/rec/conf/cpm/ISIBT14Wed, 01 Jan 2014 00:00:00 +0100 Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets.https://doi.org/10.1109/DCC.2014.62, :
Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets. DCC : 163-172]]>https://dblp.org/rec/conf/dcc/GotoB14Wed, 01 Jan 2014 00:00:00 +0100 Inferring Strings from Lyndon Factorization.https://doi.org/10.1007/978-3-662-44465-8_48, , , , , :
Inferring Strings from Lyndon Factorization. MFCS (2) : 565-576]]>https://dblp.org/rec/conf/mfcs/NakashimaOIIBT14Wed, 01 Jan 2014 00:00:00 +0100 Shortest Unique Substrings Queries in Optimal Time.https://doi.org/10.1007/978-3-319-04298-5_44, , , :
Shortest Unique Substrings Queries in Optimal Time. SOFSEM : 503-513]]>https://dblp.org/rec/conf/sofsem/TsurutaIBT14Wed, 01 Jan 2014 00:00:00 +0100 Faster Compact On-Line Lempel-Ziv Factorization.https://doi.org/10.4230/LIPIcs.STACS.2014.675, , , , :
Faster Compact On-Line Lempel-Ziv Factorization. STACS : 675-686]]>https://dblp.org/rec/conf/stacs/YamamotoIBIT14Wed, 01 Jan 2014 00:00:00 +0100 Computing Abelian Covers and Abelian Runs.http://www.stringology.org/event/2014/p05.html, , , :
Computing Abelian Covers and Abelian Runs. Stringology : 43-51]]>https://dblp.org/rec/conf/stringology/MatsudaIBT14Wed, 01 Jan 2014 00:00:00 +0100 Closed Factorization.http://www.stringology.org/event/2014/p15.html, , , , , , , :
Closed Factorization. Stringology : 162-168]]>https://dblp.org/rec/conf/stringology/BadkobehBGIIIPS14Wed, 01 Jan 2014 00:00:00 +0100 A new characterization of maximal repetitions by Lyndon trees.http://arxiv.org/abs/1406.0263, , , , , :
A new characterization of maximal repetitions by Lyndon trees. CoRR abs/1406.0263 ()]]>https://dblp.org/rec/journals/corr/BannaiIINTT14Wed, 01 Jan 2014 00:00:00 +0100 Fast q-gram mining on SLP compressed strings.https://doi.org/10.1016/j.jda.2012.07.006, , , :
Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18: 89-99 ()]]>https://dblp.org/rec/journals/jda/GotoBIT13Tue, 01 Jan 2013 00:00:00 +0100 Converting SLP to LZ78 in almost Linear Time.https://doi.org/10.1007/978-3-642-38905-4_6, , , :
Converting SLP to LZ78 in almost Linear Time. CPM : 38-49]]>https://dblp.org/rec/conf/cpm/BannaiGIT13Tue, 01 Jan 2013 00:00:00 +0100 Efficient Lyndon Factorization of Grammar Compressed Text.https://doi.org/10.1007/978-3-642-38905-4_16, , , , :
Efficient Lyndon Factorization of Grammar Compressed Text. CPM : 153-164]]>https://dblp.org/rec/conf/cpm/INIBT13Tue, 01 Jan 2013 00:00:00 +0100 Simpler and Faster Lempel Ziv Factorization.https://doi.org/10.1109/DCC.2013.21, :
Simpler and Faster Lempel Ziv Factorization. DCC : 133-142]]>https://dblp.org/rec/conf/dcc/GotoB13Tue, 01 Jan 2013 00:00:00 +0100 From Run Length Encoding to LZ78 and Back Again.https://doi.org/10.1109/DCC.2013.22, , , , :
From Run Length Encoding to LZ78 and Back Again. DCC : 143-152]]>https://dblp.org/rec/conf/dcc/TamakoshiIIBT13Tue, 01 Jan 2013 00:00:00 +0100 Computing Convolution on Grammar-Compressed Text.https://doi.org/10.1109/DCC.2013.53, , , , :
Computing Convolution on Grammar-Compressed Text. DCC : 451-460]]>https://dblp.org/rec/conf/dcc/TanakaIIBT13Tue, 01 Jan 2013 00:00:00 +0100 Detecting Regularities on Grammar-Compressed Strings.https://doi.org/10.1007/978-3-642-40313-2_51, , , , , , , :
Detecting Regularities on Grammar-Compressed Strings. MFCS : 571-582]]>https://dblp.org/rec/conf/mfcs/IMSIBTNS13Tue, 01 Jan 2013 00:00:00 +0100 Permuted Pattern Matching on Multi-track Strings.https://doi.org/10.1007/978-3-642-35843-2_25, , , , :
Permuted Pattern Matching on Multi-track Strings. SOFSEM : 280-291]]>https://dblp.org/rec/conf/sofsem/KatsuraNSBI13Tue, 01 Jan 2013 00:00:00 +0100 Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.https://doi.org/10.1007/978-3-319-02432-5_21, , , , :
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE : 174-185]]>https://dblp.org/rec/conf/spire/INIBT13Tue, 01 Jan 2013 00:00:00 +0100 Computing Reversed Lempel-Ziv Factorization Online.http://www.stringology.org/event/2013/p10.html, , , , :
Computing Reversed Lempel-Ziv Factorization Online. Stringology : 107-118]]>https://dblp.org/rec/conf/stringology/SugimotoIIBT13Tue, 01 Jan 2013 00:00:00 +0100 Compressed Automata for Dictionary Matching.https://doi.org/10.1007/978-3-642-39274-0_28, , , , :
Compressed Automata for Dictionary Matching. CIAA : 319-330]]>https://dblp.org/rec/conf/wia/INIBT13Tue, 01 Jan 2013 00:00:00 +0100 Computing convolution on grammar-compressed text.http://arxiv.org/abs/1303.3945, , , , :
Computing convolution on grammar-compressed text. CoRR abs/1303.3945 ()]]>https://dblp.org/rec/journals/corr/abs-1303-3945Tue, 01 Jan 2013 00:00:00 +0100 Efficient Lyndon factorization of grammar compressed text.http://arxiv.org/abs/1304.7061, , , , :
Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 ()]]>https://dblp.org/rec/journals/corr/abs-1304-7061Tue, 01 Jan 2013 00:00:00 +0100 Detecting regularities on grammar-compressed strings.http://arxiv.org/abs/1304.7067, , , , , , , :
Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 ()]]>https://dblp.org/rec/journals/corr/abs-1304-7067Tue, 01 Jan 2013 00:00:00 +0100 Faster Compact On-Line Lempel-Ziv Factorization.http://arxiv.org/abs/1305.6095, , , , :
Faster Compact On-Line Lempel-Ziv Factorization. CoRR abs/1305.6095 ()]]>https://dblp.org/rec/journals/corr/abs-1305-6095Tue, 01 Jan 2013 00:00:00 +0100 Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets.http://arxiv.org/abs/1310.1448, :
Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets. CoRR abs/1310.1448 ()]]>https://dblp.org/rec/journals/corr/GotoB13Tue, 01 Jan 2013 00:00:00 +0100 Finding Characteristic Substrings from Compressed Texts.https://doi.org/10.1142/S0129054112400126, :
Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. 23(2): 261-280 ()]]>https://dblp.org/rec/journals/ijfcs/InenagaB12Sun, 01 Jan 2012 00:00:00 +0100 An efficient algorithm to test square-freeness of strings compressed by straight-line programs.https://doi.org/10.1016/j.ipl.2012.06.017, , , , , :
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 ()]]>https://dblp.org/rec/journals/ipl/BannaiGIILL12Sun, 01 Jan 2012 00:00:00 +0100 Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.https://doi.org/10.1007/978-3-642-31265-6_18, , , :
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM : 220-231]]>https://dblp.org/rec/conf/cpm/GotoBIT12Sun, 01 Jan 2012 00:00:00 +0100 Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions.http://ismir2012.ismir.net/event/papers/229-ismir-2012.pdf, , , , :
Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions. ISMIR : 229-234]]>https://dblp.org/rec/conf/ismir/AnanHBTS12Sun, 01 Jan 2012 00:00:00 +0100 General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.https://doi.org/10.1007/978-3-642-33486-3_28, , , :
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. ECML/PKDD (2) : 435-450]]>https://dblp.org/rec/conf/pkdd/IEBT12Sun, 01 Jan 2012 00:00:00 +0100 Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts.https://doi.org/10.1007/978-3-642-27660-6_25, , , :
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM : 301-312]]>https://dblp.org/rec/conf/sofsem/GotoBIT12Sun, 01 Jan 2012 00:00:00 +0100 Efficient LZ78 Factorization of Grammar Compressed Text.https://doi.org/10.1007/978-3-642-34109-0_10, , :
Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE : 86-98]]>https://dblp.org/rec/conf/spire/BannaiIT12Sun, 01 Jan 2012 00:00:00 +0100 Eager XPath Evaluation over XML Streams.https://doi.org/10.1007/978-3-642-34109-0_26, , , :
Eager XPath Evaluation over XML Streams. SPIRE : 245-250]]>https://dblp.org/rec/conf/spire/HagioOBT12Sun, 01 Jan 2012 00:00:00 +0100 The Position Heap of a Trie.https://doi.org/10.1007/978-3-642-34109-0_38, , , , :
The Position Heap of a Trie. SPIRE : 360-371]]>https://dblp.org/rec/conf/spire/NakashimaIIBT12Sun, 01 Jan 2012 00:00:00 +0100 Speeding-up $q$-gram mining on grammar-based compressed texts.http://arxiv.org/abs/1202.3311, , , :
Speeding-up $q$-gram mining on grammar-based compressed texts. CoRR abs/1202.3311 ()]]>https://dblp.org/rec/journals/corr/abs-1202-3311Sun, 01 Jan 2012 00:00:00 +0100 Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding.http://arxiv.org/abs/1204.5524, , , :
Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding. CoRR abs/1204.5524 ()]]>https://dblp.org/rec/journals/corr/abs-1204-5524Sun, 01 Jan 2012 00:00:00 +0100 Efficient LZ78 factorization of grammar compressed text.http://arxiv.org/abs/1207.4607, , :
Efficient LZ78 factorization of grammar compressed text. CoRR abs/1207.4607 ()]]>https://dblp.org/rec/journals/corr/abs-1207-4607Sun, 01 Jan 2012 00:00:00 +0100 Simpler and Faster Lempel Ziv Factorization.http://arxiv.org/abs/1211.3642, :
Simpler and Faster Lempel Ziv Factorization. CoRR abs/1211.3642 ()]]>https://dblp.org/rec/journals/corr/abs-1211-3642Sun, 01 Jan 2012 00:00:00 +0100 Verifying and enumerating parameterized border arrays.https://doi.org/10.1016/j.tcs.2011.09.008, , , :
Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 ()]]>https://dblp.org/rec/journals/tcs/IIBT11Sat, 01 Jan 2011 00:00:00 +0100 Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.https://doi.org/10.1007/978-3-642-21458-5_27, , , :
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM : 309-322]]>https://dblp.org/rec/conf/cpm/YamamotoBIT11Sat, 01 Jan 2011 00:00:00 +0100 Music Genre Classification using Similarity Functions.http://ismir2011.ismir.net/papers/PS6-7.pdf, , , :
Music Genre Classification using Similarity Functions. ISMIR : 693-698]]>https://dblp.org/rec/conf/ismir/AnanHBT11Sat, 01 Jan 2011 00:00:00 +0100 Fast q-gram Mining on SLP Compressed Strings.https://doi.org/10.1007/978-3-642-24583-1_27, , , :
Fast q-gram Mining on SLP Compressed Strings. SPIRE : 278-289]]>https://dblp.org/rec/conf/spire/GotoBIT11Sat, 01 Jan 2011 00:00:00 +0100 Efficient Eager XPath Filtering over XML Streams.http://www.stringology.org/event/2011/p04.html, , , :
Efficient Eager XPath Filtering over XML Streams. Stringology : 30-44]]>https://dblp.org/rec/conf/stringology/HagioOBT11Sat, 01 Jan 2011 00:00:00 +0100 Inferring Strings from Suffix Trees and Links on a Binary Alphabet.http://www.stringology.org/event/2011/p11.html, , , :
Inferring Strings from Suffix Trees and Links on a Binary Alphabet. Stringology : 121-130]]>https://dblp.org/rec/conf/stringology/IIBT11Sat, 01 Jan 2011 00:00:00 +0100 Computing Longest Common Substring/Subsequence of Non-linear Texts.http://www.stringology.org/event/2011/p17.html, , , :
Computing Longest Common Substring/Subsequence of Non-linear Texts. Stringology : 197-208]]>https://dblp.org/rec/conf/stringology/ShimohiraIBT11Sat, 01 Jan 2011 00:00:00 +0100 Fast $q$-gram Mining on SLP Compressed Strings.http://arxiv.org/abs/1103.3114, , , :
Fast $q$-gram Mining on SLP Compressed Strings. CoRR abs/1103.3114 ()]]>https://dblp.org/rec/journals/corr/abs-1103-3114Sat, 01 Jan 2011 00:00:00 +0100 Restructuring Compressed Texts without Explicit Decompression.http://arxiv.org/abs/1107.2729, , , , , :
Restructuring Compressed Texts without Explicit Decompression. CoRR abs/1107.2729 ()]]>https://dblp.org/rec/journals/corr/abs-1107-2729Sat, 01 Jan 2011 00:00:00 +0100 Computing q-gram Frequencies on Collage Systems.http://arxiv.org/abs/1107.3019, , , :
Computing q-gram Frequencies on Collage Systems. CoRR abs/1107.3019 ()]]>https://dblp.org/rec/journals/corr/abs-1107-3019Sat, 01 Jan 2011 00:00:00 +0100 Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts.http://arxiv.org/abs/1107.3022, , , :
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts. CoRR abs/1107.3022 ()]]>https://dblp.org/rec/journals/corr/abs-1107-3022Sat, 01 Jan 2011 00:00:00 +0100 Verifying a Parameterized Border Array in O(n1.5) Time.https://doi.org/10.1007/978-3-642-13509-5_22, , , :
Verifying a Parameterized Border Array in O(n1.5) Time. CPM : 238-250]]>https://dblp.org/rec/conf/cpm/IIBT10Fri, 01 Jan 2010 00:00:00 +0100 Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.https://doi.org/10.1007/978-3-642-16184-1_10, , , :
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. Discovery Science : 132-143]]>https://dblp.org/rec/conf/dis/KashiharaHBT10Fri, 01 Jan 2010 00:00:00 +0100 Counting and Verifying Maximal Palindromes.https://doi.org/10.1007/978-3-642-16321-0_13, , , :
Counting and Verifying Maximal Palindromes. SPIRE : 135-146]]>https://dblp.org/rec/conf/spire/IIBT10Fri, 01 Jan 2010 00:00:00 +0100 The Number of Runs in a Ternary Word.http://www.stringology.org/event/2010/p16.html, , , , , :
The Number of Runs in a Ternary Word. Stringology : 178-181]]>https://dblp.org/rec/conf/stringology/BannaiGKMSS10Fri, 01 Jan 2010 00:00:00 +0100 Linear-Time Text Compression by Longest-First Substitution.https://doi.org/10.3390/a2041429, , , , , :
Linear-Time Text Compression by Longest-First Substitution. Algorithms 2(4): 1429-1448 ()]]>https://dblp.org/rec/journals/algorithms/NakamuraIBFTS09Thu, 01 Jan 2009 00:00:00 +0100 Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality.https://doi.org/10.1007/978-3-642-04747-3_40, , , :
Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. Discovery Science : 465-472]]>https://dblp.org/rec/conf/dis/YamamotoBNM09Thu, 01 Jan 2009 00:00:00 +0100 Lightweight Parameterized Suffix Array Construction.https://doi.org/10.1007/978-3-642-10217-2_31, , , , :
Lightweight Parameterized Suffix Array Construction. IWOCA : 312-323]]>https://dblp.org/rec/conf/iwoca/TomohiroDBIT09Thu, 01 Jan 2009 00:00:00 +0100 Counting Parameterized Border Arrays for a Binary Alphabet.https://doi.org/10.1007/978-3-642-00982-2_36, , , :
Counting Parameterized Border Arrays for a Binary Alphabet. LATA : 422-433]]>https://dblp.org/rec/conf/lata/IIBT09Thu, 01 Jan 2009 00:00:00 +0100 A Series of Run-Rich Strings.https://doi.org/10.1007/978-3-642-00982-2_49, , , :
A Series of Run-Rich Strings. LATA : 578-587]]>https://dblp.org/rec/conf/lata/MatsubaraKBS09Thu, 01 Jan 2009 00:00:00 +0100 Finding Characteristic Substrings from Compressed Texts.http://www.stringology.org/event/2009/p05.html, :
Finding Characteristic Substrings from Compressed Texts. Stringology : 40-54]]>https://dblp.org/rec/conf/stringology/InenagaB09Thu, 01 Jan 2009 00:00:00 +0100 Bit-parallel Algorithms for Computing all the Runs in a String.http://www.stringology.org/event/2009/p19.html, , , , :
Bit-parallel Algorithms for Computing all the Runs in a String. Stringology : 203-213]]>https://dblp.org/rec/conf/stringology/HirashimaBMIS09Thu, 01 Jan 2009 00:00:00 +0100 Uniqueness of certain association schemes.https://doi.org/10.1016/j.ejc.2007.06.016, , :
Uniqueness of certain association schemes. Eur. J. Comb. 29(6): 1379-1395 ()]]>https://dblp.org/rec/journals/ejc/BannaiBB08Tue, 01 Jan 2008 00:00:00 +0100 Reachability on Suffix Tree Graphs.https://doi.org/10.1142/S0129054108005590, , , :
Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 ()]]>https://dblp.org/rec/journals/ijfcs/HigaBIT08Tue, 01 Jan 2008 00:00:00 +0100 String Kernels Based on Variable-Length-Don't-Care Patterns.https://doi.org/10.1007/978-3-540-88411-8_29, , , , :
String Kernels Based on Variable-Length-Don't-Care Patterns. Discovery Science : 308-318]]>https://dblp.org/rec/conf/dis/NarisawaBHIT08Tue, 01 Jan 2008 00:00:00 +0100 Parameterized Suffix Arrays for Binary Strings.http://www.stringology.org/event/2008/p08.html, , , , :
Parameterized Suffix Arrays for Binary Strings. Stringology : 84-94]]>https://dblp.org/rec/conf/stringology/DeguchiHBIT08Tue, 01 Jan 2008 00:00:00 +0100 New Lower Bounds for the Maximum Number of Runs in a String.http://www.stringology.org/event/2008/p13.html, , , , :
New Lower Bounds for the Maximum Number of Runs in a String. Stringology : 140-145]]>https://dblp.org/rec/conf/stringology/MatsubaraKIBS08Tue, 01 Jan 2008 00:00:00 +0100 New Lower Bounds for the Maximum Number of Runs in a String.http://arxiv.org/abs/0804.1214, , , , :
New Lower Bounds for the Maximum Number of Runs in a String. CoRR abs/0804.1214 ()]]>https://dblp.org/rec/journals/corr/abs-0804-1214Tue, 01 Jan 2008 00:00:00 +0100 On the complexity of deriving position specific score matrices from positive and negative sequences.https://doi.org/10.1016/j.dam.2004.10.011, , , :
On the complexity of deriving position specific score matrices from positive and negative sequences. Discret. Appl. Math. 155(6-7): 676-685 ()]]>https://dblp.org/rec/journals/dam/AkutsuBMO07Mon, 01 Jan 2007 00:00:00 +0100 Efficient Computation of Substring Equivalence Classes with Suffix Arrays.https://doi.org/10.1007/978-3-540-73437-6_34, , , :
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM : 340-351]]>https://dblp.org/rec/conf/cpm/NarisawaIBT07Mon, 01 Jan 2007 00:00:00 +0100 Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.https://doi.org/10.1109/DCC.2007.70, , , :
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC : 123-132]]>https://dblp.org/rec/conf/dcc/NakamuraBIT07Mon, 01 Jan 2007 00:00:00 +0100 Unsupervised Spam Detection Based on String Alienness Measures.https://doi.org/10.1007/978-3-540-75488-6_16, , , :
Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science : 161-172]]>https://dblp.org/rec/conf/dis/NarisawaBHT07Mon, 01 Jan 2007 00:00:00 +0100 Algorithms for String Pattern Discovery.https://doi.org/10.1007/978-3-540-73729-2_3:
Algorithms for String Pattern Discovery. MDAI : 24-29]]>https://dblp.org/rec/conf/mdai/Bannai07Mon, 01 Jan 2007 00:00:00 +0100 A New Family of String Classifiers Based on Local Relatedness.https://doi.org/10.1007/11893318_14, , , :
A New Family of String Classifiers Based on Local Relatedness. Discovery Science : 114-124]]>https://dblp.org/rec/conf/dis/HigaIBT06Sun, 01 Jan 2006 00:00:00 +0100 Reachability on suffix tree graphs.http://www.stringology.org/event/2006/p20.html, , , :
Reachability on suffix tree graphs. Stringology : 212-225]]>https://dblp.org/rec/conf/stringology/HigaBIT06Sun, 01 Jan 2006 00:00:00 +0100 Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models.https://doi.org/10.1142/S0219720005001569, , , , , :
Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models. J. Bioinform. Comput. Biol. 3(6): 1295-1314 ()]]>https://dblp.org/rec/journals/jbcb/TamadaBIKKM05Sat, 01 Jan 2005 00:00:00 +0100 Practical Algorithms for Pattern Based Linear Regression.https://doi.org/10.1007/11563983_6, , , :
Practical Algorithms for Pattern Based Linear Regression. Discovery Science : 44-56]]>https://dblp.org/rec/conf/dis/BannaiHIT05Sat, 01 Jan 2005 00:00:00 +0100 Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks.https://doi.org/10.1007/11424857_38, , , , , :
Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks. ICCSA (3) : 349-356]]>https://dblp.org/rec/conf/iccsa/HiroseNTBIM05Sat, 01 Jan 2005 00:00:00 +0100 Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.https://doi.org/10.1142/S0219720004000612, , , , :
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinform. Comput. Biol. 2(2): 273-288 ()]]>https://dblp.org/rec/journals/jbcb/BannaiISTM04Thu, 01 Jan 2004 00:00:00 +0100 An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.https://doi.org/10.1109/TCBB.2004.36, , , , , :
An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 159-170 ()]]>https://dblp.org/rec/journals/tcbb/BannaiHSTNM04Thu, 01 Jan 2004 00:00:00 +0100 Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.https://doi.org/10.1007/978-3-540-30214-8_3, , , , , , :
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science : 32-46]]>https://dblp.org/rec/conf/dis/InenagaBHSTNM04Thu, 01 Jan 2004 00:00:00 +0100 Finding Optimal Pairs of Patterns.https://doi.org/10.1007/978-3-540-30219-3_38, , , , , :
Finding Optimal Pairs of Patterns. WABI : 450-462]]>https://dblp.org/rec/conf/wabi/BannaiHSTNM04Thu, 01 Jan 2004 00:00:00 +0100 The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation.http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/2003/S03-01/JFLP-A03-03/vml.pdf, :
The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation. J. Funct. Log. Program. 2003 ()]]>https://dblp.org/rec/journals/jflp/SumiiB03Wed, 01 Jan 2003 00:00:00 +0100 Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.https://doi.org/10.1007/978-3-540-39644-4_50, , , , :
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science : 486-493]]>https://dblp.org/rec/conf/dis/TakedaIBSA03Wed, 01 Jan 2003 00:00:00 +0100 Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection.https://dblp.org/pid/44/2355.html, , , , , , :
Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection. ECCB : 227-236]]>https://dblp.org/rec/conf/eccb/TamadaKBITKM03Wed, 01 Jan 2003 00:00:00 +0100 Inferring Strings from Graphs and Arrays.https://doi.org/10.1007/978-3-540-45138-9_15, , , :
Inferring Strings from Graphs and Arrays. MFCS : 208-217]]>https://dblp.org/rec/conf/mfcs/BannaiIST03Wed, 01 Jan 2003 00:00:00 +0100 Intrasplicing - Analysis of Long Intron Sequences.http://psb.stanford.edu/psb-online/proceedings/psb03/ott.pdf, , , , :
Intrasplicing - Analysis of Long Intron Sequences. Pacific Symposium on Biocomputing : 339-350]]>https://dblp.org/rec/conf/psb/OttTBNM03Wed, 01 Jan 2003 00:00:00 +0100 Extensive feature detection of N-terminal protein sorting signals.https://doi.org/10.1093/bioinformatics/18.2.298, , , , :
Extensive feature detection of N-terminal protein sorting signals. Bioinform. 18(2): 298-305 ()]]>https://dblp.org/rec/journals/bioinformatics/BannaiTMNM02Tue, 01 Jan 2002 00:00:00 +0100 Fast algorithm for extracting multiple unordered short motifs using bit operations.https://doi.org/10.1016/S0020-0255(02)00219-0, , , , :
Fast algorithm for extracting multiple unordered short motifs using bit operations. Inf. Sci. 146(1-4): 115-126 ()]]>https://dblp.org/rec/journals/isci/MaruyamaBTKM02Tue, 01 Jan 2002 00:00:00 +0100 On the Complexity of Deriving Position Specific Score Matrices from Examples.https://doi.org/10.1007/3-540-45452-7_15, , , :
On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM : 168-177]]>https://dblp.org/rec/conf/cpm/AkutsuBMO02Tue, 01 Jan 2002 00:00:00 +0100 Discovering Best Variable-Length-Don't-Care Patterns.https://doi.org/10.1007/3-540-36182-0_10, , , , :
Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science : 86-97]]>https://dblp.org/rec/conf/dis/InenagaBSTA02Tue, 01 Jan 2002 00:00:00 +0100 Foundations of Designing Computational Knowledge Discovery Processes.https://doi.org/10.1007/3-540-45884-0_34, , , :
Foundations of Designing Computational Knowledge Discovery Processes. Progress in Discovery Science : 459-470]]>https://dblp.org/rec/conf/dsp/TamadaBMM02Tue, 01 Jan 2002 00:00:00 +0100 VM lambda: A Functional Calculusfor Scientific Discovery.https://doi.org/10.1007/3-540-45788-7_18, :
VM lambda: A Functional Calculusfor Scientific Discovery. FLOPS : 290-304]]>https://dblp.org/rec/conf/flops/SumiiB02Tue, 01 Jan 2002 00:00:00 +0100 Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations.https://dblp.org/pid/44/2355.html, , , , :
Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations. JCIS : 1180-1185]]>https://dblp.org/rec/conf/jcis/MaruyamaKBMT02Tue, 01 Jan 2002 00:00:00 +0100 Space-Economical Construction of Index Structures for All Suffixes of a String.https://doi.org/10.1007/3-540-45687-2_28, , , , :
Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS : 341-352]]>https://dblp.org/rec/conf/mfcs/InenagaSTBA02Tue, 01 Jan 2002 00:00:00 +0100 HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process.http://www.ep.liu.se/ej/etai/2001/004/, , , :
HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process. Electron. Trans. Artif. Intell. 5(B): 73-83 ()]]>https://dblp.org/rec/journals/etai/BannaiTMM01Mon, 01 Jan 2001 00:00:00 +0100 VM lambda: a Functional Calculus for Scientific Discovery.https://dblp.org/pid/44/2355.html, :
VM lambda: a Functional Calculus for Scientific Discovery. APLAS : 265-275]]>https://dblp.org/rec/conf/aplas/SumiiB01Mon, 01 Jan 2001 00:00:00 +0100 VML: A View Modeling Language for Computational Knowledge Discovery.https://doi.org/10.1007/3-540-45650-3_6, , , :
VML: A View Modeling Language for Computational Knowledge Discovery. Discovery Science : 30-44]]>https://dblp.org/rec/conf/dis/BannaiTMM01Mon, 01 Jan 2001 00:00:00 +0100 Views: Fundamental Building Blocks in the Process of Knowledge Discovery.http://www.aaai.org/Library/FLAIRS/2001/flairs01-045.php, , , , :
Views: Fundamental Building Blocks in the Process of Knowledge Discovery. FLAIRS : 233-238]]>https://dblp.org/rec/conf/flairs/BannaiTMNM01Mon, 01 Jan 2001 00:00:00 +0100 A Definition of Discovery in Terms of Generalized Descriptional Complexity.https://doi.org/10.1007/3-540-46846-3_29, :
A Definition of Discovery in Terms of Generalized Descriptional Complexity. Discovery Science : 316-318]]>https://dblp.org/rec/conf/dis/BannaiM98Fri, 01 Jan 1999 00:00:00 +0100