( en | de | ru )

 

Disambiguation of "Tomita, Etsuji"

Author of the publication

copydeleteadd this publication to your clipboard
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.

, , , , and . BMC Bioinform., 12 (S-1): S13 (2011)

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.

Takemasa Tomita

Naoko Tomita

Yuto Tomita

 

Other publications of authors with the same name

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode, , and . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1998)Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data., and . IEICE Trans. Inf. Syst., 91-D (6): 1704-1718 (2008)Clique-based data mining for related genes in a biomedical database., , , and . BMC Bioinform., (2009)The Worst-Case Time Complexity for Generating All Maximal Cliques., , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 161-170. Springer, (2004)An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments., and . J. Glob. Optim., 44 (2): 311 (2009)An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata.. Theor. Comput. Sci., (1984)Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms., , , , and . J. Bioinform. Comput. Biol., 4 (1): 19-42 (2006)Guest Editors' Foreword., and . J. Graph Algorithms Appl., 20 (1): 1-2 (2016)Speeding-Up of Construction Algorithms for the Graph Coloring Problem., , , and . BWCCA, volume 159 of Lecture Notes in Networks and Systems, page 211-222. Springer, (2020)A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique., , , , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 215-226. Springer, (2016)