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

    00014

    Finland

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

Publikationer 2007 2019

Filter
Artikel
2019

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

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
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

Safely Filling Gaps with Partial Solutions Common to All Solutions

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

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil
2017

Interval scheduling maximizing minimum coverage

Mäkinen, V., Staneva, V., Tomescu, A. I., Valenzuela, D. & Wilzbach, S., 10 jul 2017, I : Discrete Applied Mathematics. 225, s. 130-135 6 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Safe and Complete Contig Assembly Through Omnitigs

Tomescu, A. I. & Medvedev, P., 1 jun 2017, I : Journal of Computational Biology. 24, 6, s. 590-602 13 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång

Set-syllogistics meet combinatorics

Omodeo, E., Policriti, A. & Tomescu, A. I., feb 2017, I : MSCS : mathematical structures in computer science.. 27, 2 (Special Issue: XIV ICTCS), s. 296-310 15 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Fil
2016

Gap Filling as Exact Path Length Problem

Salmela, L., Sahlin, K., Mäkinen, V. & Tomescu, A. I., 9 maj 2016, I : Journal of Computational Biology. 23, 5, s. 347-361 15 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Graph operations on parity games and polynomial-time algorithms

Dittmann, C., Kreutzer, S. & Tomescu, A. I., 8 feb 2016, I : Theoretical Computer Science. 614, s. 97-108 12 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2015

Enumeration of the adjunctive hierarchy of hereditarily finite sets

Audrito, G., Tomescu, A. I. & Wagner, S., jun 2015, I : Journal of Logic and Computation. 25, 3, s. 943-963 21 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly

Tomescu, A. I., Gagie, T., Popa, A., Rizzi, R., Kuosmanen, A. E. & Mäkinen, V. A. T., dec 2015, I : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 12, 6, s. 1345-1354 10 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång

Mapping Sets and Hypersets into Numbers

D’Agostino, G., Omodeo, E. G., Policriti, A. & Tomescu, A. I., 14 sep 2015, I : Fundamenta Informaticae. 140, 3-4, s. 307-328 22 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Set Graphs. V. On representing graphs as membership digraphs

Omodeo, E. G. & Tomescu, A. I., jun 2015, I : Journal of Logic and Computation. 25, 3, s. 899-919 21 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP

van Rens, K. E., Mäkinen, V. & Tomescu, A. I., 1 apr 2015, I : Bioinformatics. 31, 7, s. 1133-1135 3 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2014

A Rank-Based Sequence Aligner with Applications in Phylogenetic Analysis

Dinu, L. P., Ionescu, R. T. & Tomescu, A. I., 18 aug 2014, I : PLoS One. 9, 8, 18 s., 104006.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Motif matching using gapped patterns

Giaquinta, E., Fredriksson, K., Grabowski, S., Tomescu, A. I. & Ukkonen, E., 4 sep 2014, I : Theoretical Computer Science. 548, s. 1-13 13 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly

Rizzi, R., Tomescu, A. I. & Mäkinen, V., 10 sep 2014, I : BMC Bioinformatics. 15, S9, s. S5

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Öppen tillgång
Fil

Set graphs. II. Complexity of set graph recognition and similar problems

Milanic, M., Rizzi, R. & Tomescu, A. I., 28 aug 2014, I : Theoretical Computer Science. 547, s. 70-81 12 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

Omodeo, E. G. & Tomescu, A. I., jan 2014, I : Journal of Automated Reasoning. 52, 1, s. 1-29 29 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Set graphs. IV. Further connections with claw-freeness

Milanic, M. & Tomescu, A. I., 2014, I : Discrete Applied Mathematics. 174, s. 113-121 9 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2013

A novel min-cost flow method for estimating transcript expression with RNA-Seq

Tomescu, A. I., Kuosmanen, A., Rizzi, R. & Mäkinen, V., 10 apr 2013, I : BMC Bioinformatics. 14, (Suppl 5):S15, 10 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Markov chain algorithms for generating sets uniformly at random

Policriti, A. & Tomescu, A. I., 2013, I : Ars mathematica contemporanea. 6, 1, s. 57-68 12 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Ranking, unranking and random generation of extensional acyclic digraphs

Rizzi, R. & Tomescu, A. I., mar 2013, I : Information Processing Letters. 113, 5-6, s. 183-187 5 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Set graphs. I. Hereditarily finite sets and extensional acyclic orientations

Milanic, M. & Tomescu, A. I., mar 2013, I : Discrete Applied Mathematics. 161, 4-5, s. 677-690 14 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Well-quasi-ordering hereditarily finite sets

Policriti, A. & Tomescu, A. I., 1 jun 2013, I : International Journal of Computer Mathematics. 90, 6, s. 1278-1291 14 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2012

A randomized Numerical Aligner (rNA)

Policriti, A., Tomescu, A. I. & Vezzi, F., nov 2012, I : Journal of Computer and System Sciences. 78, 6, s. 1868-1882 15 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs

Tomescu, A. I., 6 aug 2012, I : Discrete Mathematics. 312, 15, s. 2388-2391 4 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Infinity, in short

Omodeo, E. G., Policriti, A. & Tomescu, A. I., dec 2012, I : Journal of Logic and Computation. 22, 6, s. 1391-1403 13 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

rNA: a fast and accurate short reads numerical aligner

Vezzi, F., Del Fabbro, C., Tomescu, A. I. & Policriti, A., 1 jan 2012, I : Bioinformatics. 28, 1, s. 123-124 2 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2011

Counting extensional acyclic digraphs

Policriti, A. & Tomescu, A. I., 30 aug 2011, I : Information Processing Letters. 111, 16, s. 787-791 5 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

2008

Implementing Sorting Networks with Spiking Neural P Systems

Ceterchi, R. & Tomescu, A. I., 2008, I : Fundamenta Informaticae. 87, 1, s. 35-48 14 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Sorting with P Systems: A Biological Perspective

Ardelean, I. I., Ceterchi, R. & Tomescu, A. I., 2008, I : Romanian journal of information science and technology. 11, 3, s. 243-252 10 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review

Unicyclic and bicyclic graphs having minimum degree distance

Tomescu, A. I., 1 jan 2008, I : Discrete Applied Mathematics. 156, 1, s. 125-130 6 s.

Forskningsoutput: TidskriftsbidragArtikelVetenskapligPeer review