Bastien Cazaux

40 papers B 7C 8Misc 1Journal 23

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform. CoRR Florian Ingels, Anaïs Denis, Bastien Cazaux
2024	J	`jnl`	Conway-Bromage-Lyndon (CBL): an exact, dynamic representation of Bioinform. Igor Martayan, Bastien Cazaux, Antoine Limasset, Camille Marchet
2023	J	`jnl`	Algorithms and Complexity on Indexing Founder Graphs. Algorithmica Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2023	J	`jnl`	dipwmsearch: a Python package for searching di-PWM motifs. Bioinform. Marie Mille, Julie Ripoll, Bastien Cazaux, Eric Rivals
2022	C	`conf`	Toward Optimal Fingerprint Indexing for Large Scale Genomics. WABI Clément Agret, Bastien Cazaux, Antoine Limasset
2021	B	`conf`	A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CPM Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
2021	J	`jnl`	A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs. CoRR Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
2021	B	`conf`	Algorithms and Complexity on Indexing Elastic Founder Graphs. ISAAC Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2021	J	`jnl`	Algorithms and Complexity on Indexing Founder Graphs. CoRR Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2021	J	`jnl`	Founder reconstruction enables scalable and seamless pangenomic analysis. Bioinform. Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela, Veli Mäkinen
2020	C	`conf`	Efficient Construction of Hierarchical Overlap Graphs. SPIRE Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals
2020	J	`jnl`	Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
2020	J	`jnl`	Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring. CoRR Bastien Cazaux, Eric Rivals
2020	J	`jnl`	Hierarchical Overlap Graph. Inf. Process. Lett. Bastien Cazaux, Eric Rivals
2020	C	`conf`	Linear Time Construction of Indexable Founder Block Graphs. WABI Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
2020	J	`jnl`	Linear Time Construction of Indexable Founder Block Graphs. CoRR Veli Mäkinen, Bastien Cazaux, Massimo Equi, Tuukka Norri, Alexandru I. Tomescu
2019	J	`jnl`	AQUAPONY: visualization and interpretation of phylogeographic information on phylogenetic trees. Bioinform. Bastien Cazaux, Guillaume Castel, Eric Rivals
2019	C	`conf`	Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
2019	C	`conf`	Linear Time Maximum Segmentation Problems in Column Stream Model. SPIRE Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen, Tuukka Norri
2019	J	`jnl`	Linear time minimum segmentation enables scalable founder reconstruction. Algorithms Mol. Biol. Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
2019	B	`conf`	Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. CPM Bastien Cazaux, Eric Rivals
2019	J	`jnl`	Linking indexing data structures to de Bruijn graphs: Construction and update. J. Comput. Syst. Sci. Bastien Cazaux, Thierry Lecroq, Eric Rivals
2018	J	`jnl`	Hierarchical Overlap Graph. CoRR Bastien Cazaux, Eric Rivals
2018	C	`conf`	Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. WABI Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
2018	J	`jnl`	Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. CoRR Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen
2018	B	`conf`	Practical lower and upper bounds for the Shortest Linear Superstring. SEA Bastien Cazaux, Samuel Juhel, Eric Rivals
2018	J	`jnl`	Relationship between superstring and compression measures: New insights on the greedy conjecture. Discret. Appl. Math. Bastien Cazaux, Eric Rivals
2018	J	`jnl`	Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding. CoRR Bastien Cazaux, Eric Rivals
2018	B	`conf`	Superstrings with multiplicities. CPM Bastien Cazaux, Eric Rivals
2017	J	`jnl`	The Compressed Overlap Index. CoRR Rodrigo Cánovas, Bastien Cazaux, Eric Rivals
2016	J	`jnl`	A linear time algorithm for Shortest Cyclic Cover of Strings. J. Discrete Algorithms Bastien Cazaux, Eric Rivals
2016	—	`—`	Approximation de superchaîne, indexation et assemblage de génome. (Approximation of superstring, indexation and genome assembly). Bastien Cazaux
2016	J	`jnl`	Read mapping on de Bruijn graphs. BMC Bioinform. Antoine Limasset, Bastien Cazaux, Eric Rivals, Pierre Peterlongo
2016	B	`conf`	Shortest DNA Cyclic Cover in Compressed Space. DCC Bastien Cazaux, Rodrigo Cánovas, Eric Rivals
2016	C	`conf`	Superstring Graph: A New Approach for Genome Assembly. AAIM Bastien Cazaux, Gustavo Sacomoto, Eric Rivals
2016	J	`jnl`	The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings. Discret. Appl. Math. Bastien Cazaux, Eric Rivals
2015	C	`conf`	Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. LATA Bastien Cazaux, Thierry Lecroq, Eric Rivals
2014	Misc	`conf`	Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. PSC Bastien Cazaux, Eric Rivals
2014	B	`conf`	From Indexing Data Structures to de Bruijn Graphs. CPM Bastien Cazaux, Thierry Lecroq, Eric Rivals
2014	J	`jnl`	Reverse engineering of compact suffix trees and links: A novel algorithm. J. Discrete Algorithms Bastien Cazaux, Eric Rivals

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.