Bastien Cazaux

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Toward optimal fingerprint indexing for large scale genomics	2024-08-13	Paper
Linear time maximum segmentation problems in column stream model	2024-04-19	Paper
scientific article; zbMATH DE number 7788593 (Why is no real title available?)	2024-01-15	Paper
scientific article; zbMATH DE number 7696008 (Why is no real title available?) (available as arXiv preprint)	2023-06-14	Paper
Algorithms and complexity on indexing founder graphs Algorithmica	2023-06-05	Paper
Linear time construction of indexable founder block graphs	2023-02-07	Paper
Efficient Construction of Hierarchical Overlap Graphs 1511.68104	2022-12-22	Paper
Finding all maximal perfect haplotype blocks in linear time	2022-07-27	Paper
Minimum segmentation for pan-genomic founder reconstruction in linear time (available as arXiv preprint)	2022-07-18	Paper
scientific article; zbMATH DE number 7559192 (Why is no real title available?) (available as arXiv preprint)	2022-07-18	Paper
Superstrings with multiplicities	2020-12-16	Paper
Practical lower and upper bounds for the shortest linear superstring	2020-12-16	Paper
Hierarchical overlap graph Information Processing Letters	2019-12-19	Paper
Linking indexing data structures to de Bruijn graphs: construction and update Journal of Computer and System Sciences	2019-06-25	Paper
Relationship between superstring and compression measures: new insights on the greedy conjecture Discrete Applied Mathematics	2018-05-24	Paper
Superstring graph: a new approach for genome assembly Algorithmic Aspects in Information and Management	2016-11-09	Paper
The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings Discrete Applied Mathematics	2016-09-12	Paper
A linear time algorithm for shortest cyclic cover of strings Journal of Discrete Algorithms	2016-07-15	Paper
Construction of a de Bruijn graph for assembly from a truncated suffix tree Language and Automata Theory and Applications	2016-04-08	Paper
Reverse engineering of compact suffix trees and links: a novel algorithm Journal of Discrete Algorithms	2014-09-05	Paper
From indexing data structures to de Bruijn graphs Combinatorial Pattern Matching	2014-06-30	Paper

Research outcomes over time

This page was built for person: Bastien Cazaux