( en | de | ru )

 

Disambiguation of "Takeda, Masayuki"

Author of the publication

copydeleteadd this publication to your clipboard
A practical algorithm to find the best subsequence patterns.

, , , , and . Theor. Comput. Sci., 292 (2): 465-479 (2003)

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. You can also use the button next to the name to display some publications already assigned to the person.

Masayuki Hirosue

Genichiro Takeda

Michiko Takeda

Kijuro Takeda

Takehisa Takeda

 

Other publications of authors with the same name

A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices., , and . GECCO, page 1485-1492. ACM, (2005)Factorizing a String into Squares in Linear Time., , , , and . CPM, volume 54 of LIPIcs, page 27:1-27:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , and . ISAAC, volume 92 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Faster STR-IC-LCS Computation via RLE., , , , and . CPM, volume 78 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations., , , , and . CPM, volume 128 of LIPIcs, page 29:1-29:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Minimal Unique Substrings and Minimal Absent Words in a Sliding Window., , , , , , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 148-160. Springer, (2020)An Improved Data Structure for Left-Right Maximal Generic Words Problem., , , , and . ISAAC, volume 149 of LIPIcs, page 40:1-40:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On Repetitiveness Measures of Thue-Morse Words., , , , , and . SPIRE, volume 12303 of Lecture Notes in Computer Science, page 213-220. Springer, (2020)From Run Length Encoding to LZ78 and Back Again., , , , and . DCC, page 143-152. IEEE, (2013)An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs., , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 1 (4): 159-170 (2004)