Zobrazeno 1 - 10
of 306
pro vyhledávání: '"Medvedev, Paul"'
Autor:
MEDVEDEV, PAUL1,2
Publikováno v:
Communications of the ACM. Dec2023, Vol. 66 Issue 12, p64-71. 8p.
Autor:
Schulz, Tizian1,2,3 (AUTHOR) tizian.schulz@uni-bielefeld.de, Medvedev, Paul4,5,6 (AUTHOR) pzm11@psu.edu
Publikováno v:
Algorithms for Molecular Biology. 5/4/2024, Vol. 19 Issue 1, p1-14. 14p.
Autor:
Medvedev, Paul
The theoretical analysis of performance has been an important tool in the engineering of algorithms in many application domains. Its goals are to predict the empirical performance of an algorithm and to be a yardstick that drives the design of novel
Externí odkaz:
http://arxiv.org/abs/2205.01785
Autor:
Medvedev, Paul
Given its status as a classic problem and its importance to both theoreticians and practitioners, edit distance provides an excellent lens through which to understand how the theoretical analysis of algorithms impacts practical implementations. From
Externí odkaz:
http://arxiv.org/abs/2204.09535
Autor:
MEDVEDEV, PAUL1
Publikováno v:
Communications of the ACM. Jul2023, Vol. 66 Issue 7, p118-125. 8p. 1 Color Photograph, 2 Diagrams.
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.
The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of k-mers, which are short fixed-length strings present in a dataset. Wh
Externí odkaz:
http://arxiv.org/abs/1903.12312
Publikováno v:
In iScience 18 November 2022 25(11)
Autor:
Chikhi, Rayan, Jovicic, Vladan, Kratsch, Stefan, Medvedev, Paul, Milanic, Martin, Raskhodnikova, Sofya, Varma, Nithin
We study a parameter of bipartite graphs called readability, introduced by Chikhi et al. (Discrete Applied Mathematics, 2016) and motivated by applications of overlap graphs in bioinformatics. The behavior of the parameter is poorly understood. The c
Externí odkaz:
http://arxiv.org/abs/1805.04765
Autor:
Medvedev, Paul
As computer scientists working in bioinformatics/computational biology, we often face the challenge of coming up with an algorithm to answer a biological question. This occurs in many areas, such as variant calling, alignment, and assembly. In this t
Externí odkaz:
http://arxiv.org/abs/1706.05429