Остановите войну!
for scientists:
default search action
Etsuji Tomita
- > Home > Persons > Etsuji Tomita
Publications
- 2017
- [j30]Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25: 667-677 (2017) - 2016
- [c22]Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki:
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. FAW 2016: 215-226 - 2015
- [p1]Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino:
A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State. Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015: 131-144 - 2013
- [j26]Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki:
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments. IEICE Trans. Inf. Syst. 96-D(6): 1286-1298 (2013) - [c17]Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino:
A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State. SNPD 2013: 459-465 - 2012
- [j25]Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu:
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees. J. Comput. Biol. 19(10): 1089-1104 (2012) - 2011
- [j24]Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu:
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. BMC Bioinform. 12(S-1): S13 (2011) - [c14]Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita:
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures. CISIS 2011: 536-540 - 2010
- [c13]Mitsuo Wakatsuki, Etsuji Tomita:
Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers. ICGI 2010: 313-316 - [c12]Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki:
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. WALCOM 2010: 191-203 - 2008
- [j20]Mitsuo Wakatsuki, Etsuji Tomita:
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. IEICE Trans. Inf. Syst. 91-D(6): 1704-1718 (2008) - 2007
- [c11]Etsuji Tomita, Yoichi Sutani, Takanori Higashi:
A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring. PDPTA 2007: 719-725 - 2006
- [j17]Tatsuya Akutsu, Morihiro Hayashida, Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto:
Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1215-1222 (2006) - [j16]K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu:
Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms. J. Bioinform. Comput. Biol. 4(1): 19-42 (2006) - [c10]Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada:
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data. ICGI 2006: 161-174 - [e3]Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita:
Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings. Lecture Notes in Computer Science 4201, Springer 2006, ISBN 3-540-45264-8 [contents] - 2005
- [j14]K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu:
Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach. J. Bioinform. Comput. Biol. 3(1): 103-126 (2005) - [c8]Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu:
Clique-based algorithms for protein threading with profiles and constraints. APBC 2005: 51-64 - 2004
- [j13]Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada:
Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comput. Sci. 329(1-3): 203-221 (2004) - [c6]Dukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki:
Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach. APBC 2004: 191-200 - [c5]Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto:
Protein Threading with Profiles and Constraints. BIBE 2004: 537-544 - [c3]Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita:
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. ICGI 2004: 260-272 - 2003
- [c2]Etsuji Tomita, Tomokazu Seki:
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. DMTCS 2003: 278-289 - 2000
- [c1]Yasuhiro Tajima, Etsuji Tomita:
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. ICGI 2000: 284-297 - 1997
- [j12]Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki:
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. Syst. Comput. Jpn. 28(5): 60-67 (1997) - 1995
- [j10]Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki:
A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata. IEICE Trans. Inf. Syst. 78-D(4): 305-313 (1995) - [j9]Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita:
A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State. IEICE Trans. Inf. Syst. 78-D(8): 939-950 (1995) - 1993
- [e1]Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori:
Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings. Lecture Notes in Computer Science 744, Springer 1993, ISBN 3-540-57370-4 [contents]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint