Erin K. Molloy

Orcid: 0000-0001-5553-3312

According to our database1, Erin K. Molloy authored at least 26 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast, parallel, and cache-friendly suffix array construction.
Algorithms Mol. Biol., December, 2024

Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem.
Algorithms Mol. Biol., December, 2024

2023
Quartets enable statistically consistent estimation of cell lineage trees under an unbiased error and missingness model.
Algorithms Mol. Biol., December, 2023

Quartets Enable Statistically Consistent Estimation of Cell Lineage Trees Under an Unbiased Error and Missingness Model (Abstract).
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Leveraging Constraints Plus Dynamic Programming for the Large Dollo Parsimony Problem.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

2021
Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss.
J. Comput. Biol., May, 2021

Using Constrained-INC for Large-Scale Gene Tree and Species Tree Estimation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

TIPP2: metagenomic taxonomic profiling using phylogenetic markers.
Bioinform., 2021

Advancing admixture graph estimation via maximum likelihood network orientation.
Bioinform., 2021

Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation.
Algorithms Mol. Biol., 2021

2020
Supertree-like methods for genome-scale species tree estimation
PhD thesis, 2020

FastMulRFS: fast and accurate species tree estimation under generic gene duplication and loss models.
Bioinform., 2020

Non-parametric correction of estimated gene trees using TRACTION.
Algorithms Mol. Biol., 2020

Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

2019
TreeMerge: a new method for improving the scalability of species tree estimation methods.
Bioinform., 2019

Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge.
Algorithms Mol. Biol., 2019

TRACTION: Fast Non-Parametric Improvement of Estimated Gene Trees.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Using INC Within Divide-and-Conquer Phylogeny Estimation.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2018
OCTAL: Optimal Completion of gene trees in polynomial time.
Algorithms Mol. Biol., 2018

NJMerge: A Generic Technique for Scaling Phylogeny Estimation Methods and Its Application to Species Trees.
Proceedings of the Comparative Genomics - 16th International Conference, 2018

2017
Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2015
Using Edge Voxel Information to Improve Motion Regression for rs-fMRI Connectivity Studies.
Brain Connect., 2015

2014
The influence of spatial resolution and smoothing on the detectability of resting-state and task fMRI.
NeuroImage, 2014

The Influence of Physiological Noise Correction on Test-Retest Reliability of Resting-State Functional Connectivity.
Brain Connect., 2014

2013
The effect of resting condition on resting-state fMRI reliability and consistency: A comparison between resting with eyes open, closed, and fixated.
NeuroImage, 2013

The effect of scan length on the reliability of resting-state fMRI connectivity estimates.
NeuroImage, 2013


  Loading...