12 citations · 30 across the 7 of their papers we have counts for
8 papers
Investigating the complexity of the double distance problems
Marilia D. V. Braga, Leonie R. Brockmann, Katharina Klerx +1
Two genomes over the same set of gene families form a canonical pair when each of them has exactly one gene from each family. Different distances of canonical genomes can be derive…
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches
Paola Bonizzoni, Matteo Costantini, Clelia De Felice +7
Feature embedding methods have been proposed in literature to represent sequences as numeric vectors to be used in some bioinformatics investigations, such as family classification…
On motifs in colored graphs
Diego P Rubert, Eloi Araujo, Marco A Stefanes +2
One of the most important concepts in biological network analysis is that of network motifs, which are patterns of interconnections that occur in a given network at a frequency hig…
Computing the rearrangement distance of natural genomes
Leonard Bohnenkämper, Marília D. V. Braga, Daniel Doerr +1
The computation of genomic distances has been a very active field of computational comparative genomics over the last 25 years. Substantial results include the polynomial-time comp…
Computing the Inversion-Indel Distance
Eyla Willing, Jens Stoye, Marília D. V. Braga
The inversion distance, that is the distance between two unichromosomal genomes with the same content allowing only inversions of DNA segments, can be exactly computed thanks to a…
Fast and Simple Jumbled Indexing for Binary RLE Strings
Luís Cunha, Simone Dantas, Travis Gagie +3
Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size woul…