Foto av Alexandru Tomescu
  • PL 68 (Pietari Kalmin katu 5)

    00014

    Finland

20072019

Research output per year

Om du gjort några ändringar i Pure kommer de visas här snart.

Publikationer

2018

A safe and complete algorithm for metagenomic assembly

Acosta, N. O., Mäkinen, V. & Tomescu, A. I., 7 feb 2018, I : Algorithms for Molecular Biology. 13, 12 s., 3.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples

Hujdurovic, A., Kacar, U., Milanic, M., Ries, B. & Tomescu, A. I., jan 2018, I : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 15, 1, s. 96-108 13 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem

Hujdurovic, A., Husic, E., Milanic, M., Rizzi, R. & Tomescu, A. I., jun 2018, I : ACM Transactions on Algorithms. 14, 2, 26 s., 20.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång

Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended

Kuosmanen, A., Paavilainen, T., Gagie, T., Chikhi, R., Tomescu, A. & Mäkinen, V., apr 2018, Research in Computational Molecular Biology : 22nd Annual International Conference, RECOMB 2018, Paris, France, April 21-24, 2018, Proceedings. Raphael, B. J. (red.). Cham: Springer International Publishing AG, s. 105-121 17 s. (Lecture Notes in Bioinformatics; vol. 10812).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Öppen tillgång
Fil
2019

An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph

Cairo, M., Medvedev, P., Acosta, N. O., Rizzi, R. & Tomescu, A. I., okt 2019, I : ACM Transactions on Algorithms. 15, 4, 17 s., 48.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Faster FPTASes for counting and random generation of Knapsack solutions

Rizzi, R. & Tomescu, A. I., aug 2019, I : Information and Computation. 267, s. 135-144 10 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Hardness of Covering Alignment: Phase Transition in Post-Sequence Genomics

Rizzi, R., Cairo, M., Mäkinen, V., Tomescu, A. I. & Valenzuela, D., feb 2019, I : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 16, 1, s. 23-30 8 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP

Husic, E., Li, X., Hujdurovic, A., Mehine, M., Rizzi, R., Mäkinen, V., Milanic, M. & Tomescu, A. I., 1 mar 2019, I : Bioinformatics. 35, 5, s. 769-777 9 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

On the Complexity of String Matching for Graphs

Equi, M., Grossi, R., Mäkinen, V. & Tomescu, A., 2019, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (red.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 55:1--55:15 15 s. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 132).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Öppen tillgång
Fil

Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding

Kiirala, N., Salmela, L. & Tomescu, A., 2019, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Pisanti, N. & Pissis, S. P. (red.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 8:1-8:16 16 s. (Edit Leibniz International Proceedings in Informatics (LIPIcs); vol. 128).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Öppen tillgång
Fil

Safely Filling Gaps with Partial Solutions Common to All Solutions

Salmela, L. & Tomescu, A. I., 2019, I : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 16, 2, s. 617-626 10 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Sparse Dynamic Programming on DAGs with Small Width

Mäkinen, V., Tomescu, A. I., Kuosmanen, A., Paavilainen, T., Gagie, T. & Chikhi, R., maj 2019, I : ACM Transactions on Algorithms. 15, 2, 21 s., 29.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil