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

Pieter Audenaert

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

Pageof 2
Sort By:
IEEE/ACM Transactions on Computational Biology and Bioinformatics|April 4, 2023
Improved Node and Arc Multiplicity Estimation in De Bruijn Graphs Using Approximate Inference in Conditional Random FieldsAranka Steyaert, Pieter Audenaert, Jan Fostier
BMC Bioinformatics|September 15, 2020
Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fieldsAranka Steyaert, Pieter Audenaert, Jan Fostier
Frontiers in Genetics|January 11, 2020
High-Dimensional Bayesian Network Inference From Systems Genetics Data Using Genetic Node OrderingLingfei Wang, Pieter Audenaert, Tom Michoel
Bioinformatics (Oxford, England)|November 30, 2017
Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equationsIne Melckenbeeck, Pieter Audenaert, Didier Colle, et al.
Plos One|August 26, 2025
Generating random graphs with prescribed graphlet frequency bounds derived from probabilistic networksBram Mornie, Didier Colle, Pieter Audenaert, et al.
Plos One|January 23, 2016
An Algorithm to Automatically Generate the Combinatorial Orbit Counting EquationsIne Melckenbeeck, Pieter Audenaert, Tom Michoel, et al.
Plos One|June 16, 2022
A construction heuristic for the capacitated Steiner tree problemSimon Van den Eynde, Pieter Audenaert, Didier Colle, et al.
Plos One|April 27, 2013
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search treesSofie Demeyer, Tom Michoel, Jan Fostier, et al.
Plos One|June 1, 2014
The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumerationMaarten Houbraken, Sofie Demeyer, Tom Michoel, et al.
Bioinformatics (Oxford, England)|May 5, 2017
OMSim: a simulator for optical map dataGiles Miclotte, Stéphane Plaisance, Stephane Rombauts, et al.
Pageof 2

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

Sort By:
Pageof 2
IEEE/ACM Transactions on Computational Biology and Bioinformatics|April 4, 2023
Improved Node and Arc Multiplicity Estimation in De Bruijn Graphs Using Approximate Inference in Conditional Random FieldsAranka Steyaert, Pieter Audenaert, Jan Fostier
BMC Bioinformatics|September 15, 2020
Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fieldsAranka Steyaert, Pieter Audenaert, Jan Fostier
Frontiers in Genetics|January 11, 2020
High-Dimensional Bayesian Network Inference From Systems Genetics Data Using Genetic Node OrderingLingfei Wang, Pieter Audenaert, Tom Michoel
Bioinformatics (Oxford, England)|November 30, 2017
Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equationsIne Melckenbeeck, Pieter Audenaert, Didier Colle, et al.
Plos One|August 26, 2025
Generating random graphs with prescribed graphlet frequency bounds derived from probabilistic networksBram Mornie, Didier Colle, Pieter Audenaert, et al.
Plos One|January 23, 2016
An Algorithm to Automatically Generate the Combinatorial Orbit Counting EquationsIne Melckenbeeck, Pieter Audenaert, Tom Michoel, et al.
Plos One|June 16, 2022
A construction heuristic for the capacitated Steiner tree problemSimon Van den Eynde, Pieter Audenaert, Didier Colle, et al.
Plos One|April 27, 2013
The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search treesSofie Demeyer, Tom Michoel, Jan Fostier, et al.
Plos One|June 1, 2014
The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumerationMaarten Houbraken, Sofie Demeyer, Tom Michoel, et al.
Bioinformatics (Oxford, England)|May 5, 2017
OMSim: a simulator for optical map dataGiles Miclotte, Stéphane Plaisance, Stephane Rombauts, et al.
Pageof 2