Artikler med mandater om offentlig tilgang - Hideo BannaiLes mer
Ikke tilgjengelige noe sted: 2
Factorizing strings into repetitions
H Inoue, Y Matsuoka, Y Nakashima, S Inenaga, H Bannai, M Takeda
Theory of Computing Systems 66 (2), 484-501, 2022
Mandater: Japan Science and Technology Agency
Space-Efficient STR-IC-LCS Computation
Y Yonemoto, Y Nakashima, S Inenaga, H Bannai
International Conference on Current Trends in Theory and Practice of …, 2023
Mandater: Japan Science and Technology Agency
Tilgjengelige et eller annet sted: 17
Diverse palindromic factorization is NP-complete
H Bannai, T Gagie, S Inenaga, J Kärkkäinen, D Kempa, M Piątkowski, ...
Developments in Language Theory: 19th International Conference, DLT 2015 …, 2015
Mandater: Academy of Finland
Closed factorization
G Badkobeh, H Bannai, K Goto, T I, CS Iliopoulos, S Inenaga, SJ Puglisi, ...
Discrete Applied Mathematics 212, 23-29, 2016
Mandater: Academy of Finland
Finding all maximal perfect haplotype blocks in linear time
J Alanko, H Bannai, B Cazaux, P Peterlongo, J Stoye
Algorithms for Molecular Biology 15, 1-7, 2020
Mandater: Agence Nationale de la Recherche
Indexing the bijective BWT
H Bannai, J Kärkkäinen, D Köppl, M Piatkowski
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 17: 1-17: 14, 2019
Mandater: European Commission
c-trie++: A dynamic trie tailored for fast prefix searches
K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ...
Information and Computation 285, 104794, 2022
Mandater: Japan Science and Technology Agency
The smallest grammar problem revisited
H Bannai, M Hirayama, D Hucke, S Inenaga, A Jeż, M Lohrey, CP Reh
IEEE Transactions on Information Theory 67 (1), 317-328, 2020
Mandater: German Research Foundation
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
H Bannai, T Gagie, T I, S Inenaga, GM Landau, M Lewenstein
Information Processing Letters, 2012
Mandater: German Research Foundation
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches
K Nakashima, N Fujisato, D Hendrian, Y Nakashima, R Yoshinaka, ...
Theoretical Computer Science 933, 21-42, 2022
Mandater: Japan Science and Technology Agency
Combinatorics of minimal absent words for a sliding window
T Akagi, Y Kuhara, T Mieno, Y Nakashima, S Inenaga, H Bannai, ...
Theoretical Computer Science 927, 109-119, 2022
Mandater: Japan Science and Technology Agency
Order-preserving pattern matching indeterminate strings
R Henriques, AP Francisco, L Russo, H Bannai
29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2: 1-2: 15, 2018
Mandater: Fundação para a Ciência e a Tecnologia, Portugal, European Commission
More time-space tradeoffs for finding a shortest unique substring
H Bannai, T Gagie, G Hoppenworth, SJ Puglisi, LMS Russo
Algorithms 13 (9), 234, 2020
Mandater: Natural Sciences and Engineering Research Council of Canada, Academy of …
Maintaining the size of LZ77 on semi-dynamic strings
H Bannai, P Charalampopoulos, J Radoszewski
35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024), 3: 1-3: 20, 2024
Mandater: Narodowe Centrum Nauki
HaploBlocks: efficient detection of positive selection in large population genomic datasets
B Kirsch-Gerweck, L Bohnenkämper, MT Henrichs, JN Alanko, H Bannai, ...
Molecular biology and evolution 40 (3), msad027, 2023
Mandater: European Commission, Federal Ministry of Education and Research, Germany
Computing Longest (Common) Lyndon Subsequences
H Bannai, T I, T Kociumaka, D Köppl, SJ Puglisi
arXiv preprint arXiv:2201.06773, 2022
Mandater: US National Science Foundation
On longest common property preserved substring queries
K Kai, Y Nakashima, S Inenaga, H Bannai, M Takeda, T Kociumaka
International Symposium on String Processing and Information Retrieval, 162-174, 2019
Mandater: European Commission
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
H Bannai, T I, T Kociumaka, D Köppl, SJ Puglisi
Algorithmica 86 (3), 735-756, 2024
Mandater: US National Science Foundation, Academy of Finland
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
L Leonard, S Inenaga, H Bannai, T Mieno
International Symposium on String Processing and Information Retrieval, 24-37, 2022
Mandater: Japan Science and Technology Agency
Informasjon om publisering og finansiering fastsettes automatisk av et datamaskinprogram