Photo of Alexandru Tomescu

Alexandru Tomescu

  • PL 68 (Pietari Kalmin katu 5)

    00014

    Finland

20072019
If you made any changes in Pure these will be visible here soon.

Publications 2007 2019

Filter
Article
2019

Faster FPTASes for counting and random generation of Knapsack solutions

Rizzi, R. & Tomescu, A. I., Aug 2019, In : Information and Computation. 267, p. 135-144 10 p.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

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

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

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, In : Bioinformatics. 35, 5, p. 769-777 9 p.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

Safely Filling Gaps with Partial Solutions Common to All Solutions

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

Sparse Dynamic Programming on DAGs with Small Width

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File
2018

A safe and complete algorithm for metagenomic assembly

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

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, In : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 15, 1, p. 96-108 13 p.

Research output: Contribution to journalArticleScientificpeer-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, In : ACM Transactions on Algorithms. 14, 2, 26 p., 20.

Research output: Contribution to journalArticleScientificpeer-review

Open Access
2017

Interval scheduling maximizing minimum coverage

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

Research output: Contribution to journalArticleScientificpeer-review

Safe and Complete Contig Assembly Through Omnitigs

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Set-syllogistics meet combinatorics

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

Research output: Contribution to journalArticleScientificpeer-review

File
2016

Gap Filling as Exact Path Length Problem

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

Graph operations on parity games and polynomial-time algorithms

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

Research output: Contribution to journalArticleScientificpeer-review

2015

Enumeration of the adjunctive hierarchy of hereditarily finite sets

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

Research output: Contribution to journalArticleScientificpeer-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, In : IEEE/ACM Transactions on Computational Biology and Bioinformatics. 12, 6, p. 1345-1354 10 p.

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Mapping Sets and Hypersets into Numbers

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

Research output: Contribution to journalArticleScientificpeer-review

Set Graphs. V. On representing graphs as membership digraphs

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

Research output: Contribution to journalArticleScientificpeer-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, In : Bioinformatics. 31, 7, p. 1133-1135 3 p.

Research output: Contribution to journalArticleScientificpeer-review

2014

A Rank-Based Sequence Aligner with Applications in Phylogenetic Analysis

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

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

Motif matching using gapped patterns

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

Research output: Contribution to journalArticleScientificpeer-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, In : BMC Bioinformatics. 15, S9, p. S5

Research output: Contribution to journalArticleScientificpeer-review

Open Access
File

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

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

Research output: Contribution to journalArticleScientificpeer-review

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

Omodeo, E. G. & Tomescu, A. I., Jan 2014, In : Journal of Automated Reasoning. 52, 1, p. 1-29 29 p.

Research output: Contribution to journalArticleScientificpeer-review

Set graphs. IV. Further connections with claw-freeness

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

Research output: Contribution to journalArticleScientificpeer-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, In : BMC Bioinformatics. 14, (Suppl 5):S15, 10 p.

Research output: Contribution to journalArticleScientificpeer-review

Markov chain algorithms for generating sets uniformly at random

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

Research output: Contribution to journalArticleScientificpeer-review

Ranking, unranking and random generation of extensional acyclic digraphs

Rizzi, R. & Tomescu, A. I., Mar 2013, In : Information Processing Letters. 113, 5-6, p. 183-187 5 p.

Research output: Contribution to journalArticleScientificpeer-review

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

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

Research output: Contribution to journalArticleScientificpeer-review

Well-quasi-ordering hereditarily finite sets

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

Research output: Contribution to journalArticleScientificpeer-review

2012

A randomized Numerical Aligner (rNA)

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

Research output: Contribution to journalArticleScientificpeer-review

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

Tomescu, A. I., 6 Aug 2012, In : Discrete Mathematics. 312, 15, p. 2388-2391 4 p.

Research output: Contribution to journalArticleScientificpeer-review

Infinity, in short

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

Research output: Contribution to journalArticleScientificpeer-review

rNA: a fast and accurate short reads numerical aligner

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

Research output: Contribution to journalArticleScientificpeer-review

2011

Counting extensional acyclic digraphs

Policriti, A. & Tomescu, A. I., 30 Aug 2011, In : Information Processing Letters. 111, 16, p. 787-791 5 p.

Research output: Contribution to journalArticleScientificpeer-review

2008

Implementing Sorting Networks with Spiking Neural P Systems

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

Research output: Contribution to journalArticleScientificpeer-review

Sorting with P Systems: A Biological Perspective

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

Research output: Contribution to journalArticleScientificpeer-review

Unicyclic and bicyclic graphs having minimum degree distance

Tomescu, A. I., 1 Jan 2008, In : Discrete Applied Mathematics. 156, 1, p. 125-130 6 p.

Research output: Contribution to journalArticleScientificpeer-review