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

Jesun Sahariar Firoz

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

Pageof 1
Sort By:
Thescientificworldjournal|July 22, 2014
New sufficient conditions for Hamiltonian pathsM Sohel Rahman, M Kaykobad, Jesun Sahariar Firoz
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|June 28, 2011
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) timeJesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, et al.
Pageof 1

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

Sort By:
Pageof 1
Thescientificworldjournal|July 22, 2014
New sufficient conditions for Hamiltonian pathsM Sohel Rahman, M Kaykobad, Jesun Sahariar Firoz
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|June 28, 2011
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) timeJesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, et al.
Pageof 1