| Publication | Date of Publication | Type |
|---|
A linear time algorithm for an extended version of the breakpoint double distance
| 2024-08-13 | Paper |
On the class of double distance problems
Comparative Genomics | 2023-12-12 | Paper |
Computing the rearrangement distance of natural genomes
Lecture Notes in Computer Science | 2022-10-14 | Paper |
Finding all maximal perfect haplotype blocks in linear time
| 2022-07-27 | Paper |
Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
| 2021-12-21 | Paper |
The potential of family-free genome comparison
Models and Algorithms for Genome Evolution | 2021-06-10 | Paper |
The genesis of the DCJ formula
Models and Algorithms for Genome Evolution | 2021-06-10 | Paper |
Searching and inferring colorful topological motifs in vertex-colored graphs
Journal of Combinatorial Optimization | 2020-07-29 | Paper |
Fast and simple jumbled indexing for binary run-length encoded strings
| 2020-05-25 | Paper |
A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates
| 2018-03-23 | Paper |
Dynamic alignment-free and reference-free read compression
| 2018-03-22 | Paper |
Bloom filter trie -- a data structure for pan-genome storage
Lecture Notes in Computer Science | 2017-07-25 | Paper |
New genome similarity measures based on conserved gene adjacencies
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Common intervals of multiple permutations
Algorithmica | 2011-05-10 | Paper |
On the similarity of sets of permutations and its applications to genome comparison
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Balanced vertices in trees and a simpler algorithm to compute the genomic distance
Applied Mathematics Letters | 2010-11-19 | Paper |
Indexing and searching a mass spectrometry database
Algorithms and Applications | 2010-05-04 | Paper |
A new linear time algorithm to compute the genomic distance via the double cut and join distance
Theoretical Computer Science | 2009-11-18 | Paper |
Counting suffix arrays and strings
Theoretical Computer Science | 2008-07-10 | Paper |
HP Distance Via Double Cut and Join Distance
Combinatorial Pattern Matching | 2008-06-17 | Paper |
scientific article; zbMATH DE number 5031986 (Why is no real title available?)
| 2006-06-14 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
scientific article; zbMATH DE number 2185638 (Why is no real title available?)
| 2005-07-04 | Paper |
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Algorithmic complexity of protein identification: Combinatorics of weighted strings
Discrete Applied Mathematics | 2004-02-14 | Paper |
Algorithms for Finding Gene Clusters
Lecture Notes in Computer Science | 2003-04-06 | Paper |
scientific article; zbMATH DE number 1786460 (Why is no real title available?)
| 2002-08-21 | Paper |
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science | 2002-03-03 | Paper |
