( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A new characterization of maximal repetitions by Lyndon trees.

, , , , , и . SODA, стр. 562-571. SIAM, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Hideo Baba

Hideo Ohashi

Hideo Andreas Baba

Hideo Ikezawa-Hanada

 

Другие публикации лиц с тем же именем

NP-Completeness for the Space-Optimality of Double-Array Tries., , , и . CoRR, (2024)Computing Longest (Common) Lyndon Subsequences., , , , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 128-142. Springer, (2022)Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks., , , , , и . ICCSA (3), том 3482 из Lecture Notes in Computer Science, стр. 349-356. Springer, (2005)Finding Characteristic Substrings from Compressed Texts., и . Stringology, стр. 40-54. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Bit-parallel Algorithms for Computing all the Runs in a String., , , , и . Stringology, стр. 203-213. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Computing Reversed Lempel-Ziv Factorization Online., , , , и . Stringology, стр. 107-118. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)New Lower Bounds for the Maximum Number of Runs in a String., , , , и . Stringology, стр. 140-145. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection., , , , , , и . ECCB, стр. 227-236. (2003)General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations., , , и . ECML/PKDD (2), том 7524 из Lecture Notes in Computer Science, стр. 435-450. Springer, (2012)Converting SLP to LZ78 in almost Linear Time., , , и . CPM, том 7922 из Lecture Notes in Computer Science, стр. 38-49. Springer, (2013)