Fabio Vandin

ACM Trans. Knowl. Discov. Data, 2020

Fast Approximation of Frequent k-Mers and Applications to Metagenomics.

[BibT_eX]

[DOI]

Cinzia Pizzi

J. Comput. Biol., 2020

Efficient mining of the most significant patterns with permutation testing.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2020

A Meta-Learning Approach for Graph Representation Learning in Multi-Task Settings.

[BibT_eX]

[DOI]

Davide Buffelli

CoRR, 2020

Attention-Based Deep Learning Framework for Human Activity Recognition with User Adaptation.

[BibT_eX]

[DOI]

Davide Buffelli

CoRR, 2020

Are Graph Convolutional Networks Fully Exploiting Graph Structure?

[BibT_eX]

[DOI]

Davide Buffelli

CoRR, 2020

Mining Sequential Patterns with VC-Dimension and Rademacher Complexity.

[BibT_eX]

[DOI]

Diego Santoro

Andrea Tonon

Algorithms, 2020

2019

CoExpresso: assess the quantitative behavior of protein complexes in human cells.

[BibT_eX]

[DOI]

Morteza Chalabi Hajkarim

BMC Bioinform., December, 2019

Efficient algorithms to discover alterations with complementary functional association in cancer.

[BibT_eX]

[DOI]

Rebecca Sarto Basso

Dorit S. Hochbaum

PLoS Comput. Biol., 2019

Differentially mutated subnetworks discovery.

[BibT_eX]

[DOI]

Morteza Chalabi Hajkarim

Algorithms Mol. Biol., 2019

Hypothesis Testing and Statistically-sound Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

SPuManTE: Significant Pattern Mining with Unconditional Testing.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Permutation Strategies for Mining Significant Sequential Patterns.

[BibT_eX]

[DOI]

Andrea Tonon

Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2017

Clustering Uncertain Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Efficient detection of differentially methylated regions using DiMmeR.

[BibT_eX]

[DOI]

Bioinform., 2017

2016

Jllumina - A comprehensive Java-based API for statistical Illumina Infinium HumanMethylation450 and MethylationEPIC data processing.

[BibT_eX]

[DOI]

Diogo Almeida

Ida Skov

Jesper Lund

Afsaneh Mohammadnejad

J. Integr. Bioinform., 2016

On the Sample Complexity of Cancer Pathways Identification.

[BibT_eX]

[DOI]

J. Comput. Biol., 2016

An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer.

[BibT_eX]

[DOI]

Anna Bomersbach

Marco Chiarandini

Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

The Second Decade of the International Conference on Research in Computational Molecular Biology (RECOMB).

[BibT_eX]

[DOI]

Farhad Hormozdiari

Fereydoun Hormozdiari

Carl Kingsford

Paul Medvedev

Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

Finding Mutated Subnetworks Associated with Survival in Cancer.

[BibT_eX]

[DOI]

Tommy Hansen

Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

Reconstructing Hidden Permutations Using the Average-Precision (AP) Correlation Statistic.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Accurate Computation of Survival Statistics in Genome-Wide Studies.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2015

Space-efficient parallel algorithms for combinatorial search problems.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

Simultaneous Inference of Cancer Pathways and Tumor Progression from Cross-Sectional Mutation Data.

[BibT_eX]

[DOI]

J. Comput. Biol., 2015

CoMEt: A Statistical Approach to Identify Combinations of Mutually Exclusive Alterations in Cancer.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2015

2014

Finding the True Frequent Itemsets.

[BibT_eX]

[DOI]

Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

2013

Ballast: A Ball-based Algorithm for Structural Motifs.

[BibT_eX]

[DOI]

J. Comput. Biol., 2013

Controlling False Positives in Frequent Itemsets Mining through the VC-Dimension

[BibT_eX]

[DOI]

CoRR, 2013

Genome-Wide Survival Analysis of Somatic Mutations in Cancer.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2013

Identifying significant mutations in large cohorts of cancer genomes.

[BibT_eX]

[DOI]

Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

2012

An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.

[BibT_eX]

[DOI]

J. ACM, 2012

Algorithms and Genome Sequencing: Identifying Driver Pathways in Cancer.

[BibT_eX]

[DOI]

Computer, 2012

Finding Driver Pathways in Cancer: Models and Algorithms.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2012

Discovery of Mutated Subnetworks Associated with Clinical Data in Cancer.

[BibT_eX]

[DOI]

Proceedings of the Biocomputing 2012: Proceedings of the Pacific Symposium, 2012

Algorithms on evolving graphs.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Workshop: Algorithms for discovery of mutated pathways in cancer.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

2011

Algorithms for Detecting Significantly Mutated Pathways in Cancer.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

MADMX: A Strategy for Maximal Dense Motif Extraction.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

De Novo Discovery of Mutated Driver Pathways in Cancer.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2011

2010

Mining top-K frequent itemsets through progressive sampling.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2010

Mining Top-K Frequent Itemsets Through Progressive Sampling

[BibT_eX]

[DOI]

CoRR, 2010

2009

MADMX: A Novel Strategy for Maximal Dense Motif Extraction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

2007

Efficient Incremental Mining of Top-K Frequent Closed Itemsets.

[BibT_eX]

[DOI]

Andrea Pietracaprina