E-LIB Suche - Ergebnisse für: Tomescu, Alexandru I

1

Width Helps and Hinders Splitting Flows:

Cáceres, Manuel ; Cairo, Massimo ; Grigorjew, Andreas...
ACM Transactions on Algorithms. 20 (2024) 2 - p. 1-20 , 2024

Link: https://doi.org/10.1145/..

2

Simplicity in Eulerian circuits: Uniqueness and safety:

Obscura Acosta, Nidia ; Tomescu, Alexandru I.
Information Processing Letters. 183 (2024) - p. 106421 , 2024

Link: https://doi.org/10.1016/..

3

cloudrnaSPAdes: isoform assembly using bulk barcoded RNA se..:

Meleshko, Dmitry ; Prjbelski, Andrey D ; Raiko, Mikhail...
Bioinformatics. 40 (2024) 2 - p. , 2024

Link: https://doi.org/10.1093/..

4

PABLOG: a Primer Analysis tool using a Bee‐Like approach on..:

Ferrigno, Michele ; Frazzetto, Paola ; Prjibelski, Andrey..
Physiologia Plantarum. 176 (2024) 3 - p. , 2024

Link: https://doi.org/10.1111/..

5

Genome-scale algorithm design

bioinformatics in the era of high-throughput sequencing

Mäkinen, Veli ; Belazzougui, Djamal ; Tomescu, Alexandru I.. - Second edition. . , 2023

Link: https://doi.org/10.1017/..

6

Matchtigs: minimum plain text representation of k-mer sets:

Schmidt, Sebastian ; Khan, Shahbaz ; Alanko, Jarno N...
Genome Biology. 24 (2023) 1 - p. , 2023

Link: https://doi.org/10.1186/..

7

Chaining for accurate alignment of erroneous long reads to ..:

Ma, Jun ; Cáceres, Manuel ; Salmela, Leena...
Bioinformatics. 39 (2023) 8 - p. , 2023

Link: https://doi.org/10.1093/..

8

Sensitive inference of alignment-safe intervals from biodiv..:

Grigorjew, Andreas ; Gynter, Artur ; Dias, Fernando H. C....
Genome Biology. 24 (2023) 1 - p. , 2023

Link: https://doi.org/10.1186/..

9

On the Complexity of String Matching for Graphs:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I..
ACM Transactions on Algorithms. 19 (2023) 3 - p. 1-25 , 2023

Link: https://doi.org/10.1145/..

10

A safety framework for flow decomposition problems via inte..:

Dias, Fernando H C ; Cáceres, Manuel ; Williams, Lucia...
Bioinformatics. 39 (2023) 11 - p. , 2023

Link: https://doi.org/10.1093/..

11

Graphs cannot be indexed in polynomial time for sub-quadrat..:

Equi, Massimo ; Mäkinen, Veli ; Tomescu, Alexandru I.
Theoretical Computer Science. 975 (2023) - p. 114128 , 2023

Link: https://doi.org/10.1016/..

12

Extremely fast construction and querying of compacted and c..:

Cracco, Andrea ; Tomescu, Alexandru I.
Genome Research. , 2023

Link: https://doi.org/10.1101/..

13

Genome Assembly, from Practice to Theory: Safe, Complete an..:

Cairo, Massimo ; Rizzi, Romeo ; Tomescu, Alexandru I..
ACM Transactions on Algorithms. 20 (2023) 1 - p. 1-26 , 2023

Link: https://doi.org/10.1145/..

14

Fast, Flexible, and Exact Minimum Flow Decompositions via I..:

, In: Lecture Notes in Computer Science; Research in Computational Molecular Biology,

Dias, Fernando H. C. ; Williams, Lucia ; Mumey, Brendan. - p. 230-245 , 2022

Link: https://doi.org/10.1007/..

15

Algorithms and Complexity on Indexing Founder Graphs:

Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno...
Algorithmica. 85 (2022) 6 - p. 1586-1623 , 2022

Link: https://doi.org/10.1007/..