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

Aleksandar Shurbevski

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

Pageof 1
Sort By:
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.
IEEE/ACM Transactions on Computational Biology and Bioinformatics|September 14, 2021
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer ProgrammingJianshen Zhu, Naveed Ahmed Azam, Fan Zhang, et al.
Algorithms for Molecular Biology : AMB|August 15, 2021
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programmingNaveed Ahmed Azam, Jianshen Zhu, Yanming Sun, et al.
Pageof 1

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

Sort By:
Pageof 1
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.
IEEE/ACM Transactions on Computational Biology and Bioinformatics|September 14, 2021
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer ProgrammingJianshen Zhu, Naveed Ahmed Azam, Fan Zhang, et al.
Algorithms for Molecular Biology : AMB|August 15, 2021
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programmingNaveed Ahmed Azam, Jianshen Zhu, Yanming Sun, et al.
Pageof 1