Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Hiroshi Nagamochi

Showing results (1-10 of 21) with videos related to

Pageof 3
Sort By:
Computational and Structural Biotechnology Journal|April 2, 2014
Comparison and enumeration of chemical graphsTatsuya Akutsu, Hiroshi Nagamochi
IEEE/ACM Transactions on Computational Biology and Bioinformatics|January 24, 2017
Enumerating Substituted Benzene Isomers of Tree-Like Chemical GraphsJinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu
BMC Bioinformatics|March 1, 2012
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequenciesMasaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu
Journal of Cheminformatics|June 24, 2014
Efficient enumeration of monocyclic chemical graphs with given path frequenciesMasaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu
Entropy (Basel, Switzerland)|December 8, 2020
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-LoopsNaveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
Entropy (Basel, Switzerland)|December 8, 2020
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle RankNaveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
IEEE/ACM Transactions on Computational Biology and Bioinformatics|July 12, 2018
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical GraphsYuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, et al.
Journal of Chemical Information and Modeling|August 19, 2011
Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programmingTomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, et al.
Genome Informatics. International Conference on Genome Informatics|May 9, 2009
Improved algorithms for enumerating tree-like chemical graphs with given path frequencyYusuke Ishida, Liang Zhao, Hiroshi Nagamochi, et al.
Journal of Bioinformatics and Computational Biology|December 31, 2013
Breadth-first search approach to enumeration of tree-like chemical compoundsYang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, et al.
Pageof 3

Showing results (1-10 of 21) with videos related to

Sort By:
Pageof 3
Computational and Structural Biotechnology Journal|April 2, 2014
Comparison and enumeration of chemical graphsTatsuya Akutsu, Hiroshi Nagamochi
IEEE/ACM Transactions on Computational Biology and Bioinformatics|January 24, 2017
Enumerating Substituted Benzene Isomers of Tree-Like Chemical GraphsJinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu
BMC Bioinformatics|March 1, 2012
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequenciesMasaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu
Journal of Cheminformatics|June 24, 2014
Efficient enumeration of monocyclic chemical graphs with given path frequenciesMasaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu
Entropy (Basel, Switzerland)|December 8, 2020
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-LoopsNaveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
Entropy (Basel, Switzerland)|December 8, 2020
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle RankNaveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
IEEE/ACM Transactions on Computational Biology and Bioinformatics|July 12, 2018
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical GraphsYuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, et al.
Journal of Chemical Information and Modeling|August 19, 2011
Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programmingTomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, et al.
Genome Informatics. International Conference on Genome Informatics|May 9, 2009
Improved algorithms for enumerating tree-like chemical graphs with given path frequencyYusuke Ishida, Liang Zhao, Hiroshi Nagamochi, et al.
Journal of Bioinformatics and Computational Biology|December 31, 2013
Breadth-first search approach to enumeration of tree-like chemical compoundsYang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, et al.
Pageof 3