Zobrazeno 1 - 10
of 473
pro vyhledávání: '"Stoye, Jens"'
Genome rearrangement has been an active area of research in computational comparative genomics for the last three decades. While initially mostly an interesting algorithmic endeavor, now the practical application by applying rearrangement distance me
Externí odkaz:
http://arxiv.org/abs/2411.01691
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 derived from a structure called breakpoint graph, which represents the relat
Externí odkaz:
http://arxiv.org/abs/2303.04205
Autor:
Bonizzoni, Paola, Costantini, Matteo, De Felice, Clelia, Petescia, Alessia, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella, Stoye, Jens, Zaccagnino, Rocco, Zizza, Rosalba
Publikováno v:
Information Sciences 607 (2022) 458-476
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 and protein structure prediction. Recent theoretical results showed t
Externí odkaz:
http://arxiv.org/abs/2202.13884
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 higher than expected in a random network. In this work we are interested
Externí odkaz:
http://arxiv.org/abs/2005.13634
Publikováno v:
Lecture Notes in Computer Science, vol 12074, 2020
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 computability of the inversion distance by Hannenhalli and Pevzner in 1995
Externí odkaz:
http://arxiv.org/abs/2001.02139
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 pioneering approach of Hannenhalli and Pevzner from 1995. In 2000, El-
Externí odkaz:
http://arxiv.org/abs/1909.12877
Publikováno v:
In iScience 17 June 2022 25(6)
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 would now be a breakthrough with broad implications. We can still make pro
Externí odkaz:
http://arxiv.org/abs/1702.01280
Publikováno v:
In iScience 21 August 2020 23(8)
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.