István Miklós

Lajos Soukup

CoRR, 2024

2023

A Markov chain on the solution space of edge colorings of bipartite graphs.

[BibT_eX]

[DOI]

Letong Hong

Discret. Appl. Math., June, 2023

Constructing bounded degree graphs with prescribed degree and neighbor degree sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., June, 2023

Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121).

[BibT_eX]

[DOI]

David I. Bevan

Miklós Bóna

Dagstuhl Reports, March, 2023

Dense, irregular, yet always graphic 3-uniform hypergraph degree sequences.

[BibT_eX]

[DOI]

Runze Li

CoRR, 2023

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The mixing time of switch Markov chains: A unified approach.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Eur. J. Comb., 2022

Approximate Sampling of Graphs with Near-P-stable Degree Intervals.

[BibT_eX]

[DOI]

Tamás Róbert Mezei

CoRR, 2022

2021

Edge disjoint caterpillar realizations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

#P-hardness proofs of matrix immanants evaluated on restricted matrices.

[BibT_eX]

[DOI]

Cordian Riener

CoRR, 2021

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Packing Tree Degree Sequences.

[BibT_eX]

[DOI]

Aravind Gollakota

Will Hardt

Graphs Comb., 2020

2019

Packing tree degree sequences.

[BibT_eX]

[DOI]

Informatica (Slovenia), 2019

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.

[BibT_eX]

[DOI]

CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.

[BibT_eX]

[DOI]

Catherine S. Greenhill

CoRR, 2019

The computational complexity of calculating partition functions of optimal medians with Hamming distance.

[BibT_eX]

[DOI]

Heather C. Smith

Adv. Appl. Math., 2019

2018

Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2018

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

2017

Half-regular factorizations of the complete bipartite graph.

[BibT_eX]

[DOI]

Mark Aksen

Kathleen Zhou

Discret. Appl. Math., 2017

Graph Realizations Constrained by Skeleton Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

Statistical Multiple Alignment.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2016

The second order degree sequence problem is NP-complete.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Sampling and counting genome rearrangement scenarios.

[BibT_eX]

[DOI]

Heather C. Smith

BMC Bioinform., December, 2015

A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

On realizations of a joint degree matrix.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Approximate statistical alignment by iterative sampling of substitution matrices.

[BibT_eX]

[DOI]

CoRR, 2015

Exact sampling of graphs with prescribed degree correlations.

[BibT_eX]

[DOI]

CoRR, 2015

Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphs.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

2014

Counting and sampling SCJ small parsimony solutions.

[BibT_eX]

[DOI]

Sándor Z. Kiss

Theor. Comput. Sci., 2014

Modulated string searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Information Extraction from Hungarian, English and German CVs for a Career Portal.

[BibT_eX]

[DOI]

Proceedings of the Mining Intelligence and Knowledge Exploration, 2014

2013

On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.

[BibT_eX]

[DOI]

Zoltán Király

Comb. Probab. Comput., 2013

On sampling SCJ rearrangement scenarios

[BibT_eX]

[DOI]

Sándor Z. Kiss

CoRR, 2013

Proving the Pressing Game Conjecture on Linear Graphs

[BibT_eX]

[DOI]

Eliot Bixby

Toby Flint

CoRR, 2013

Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence.

[BibT_eX]

[DOI]

Lajos Soukup

Electron. J. Comb., 2013

2012

Approximating the number of Double Cut-and-Join scenarios.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Positive Evolutionary Selection of an HD Motif on Alzheimer Precursor Protein Orthologues Suggests a Functional Role.

[BibT_eX]

[DOI]

Zoltán Zádori

PLoS Comput. Biol., 2012

2010

The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths.

[BibT_eX]

[DOI]

Bence Mélykúti

Krister M. Swenson

IEEE ACM Trans. Comput. Biol. Bioinform., 2010

MCMC Network: Graphical Interface for Bayesian Analysis of Metabolic Networks.

[BibT_eX]

[DOI]

Eszter Friedman

Jotun Hein

ERCIM News, 2010

A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Reticular Alignment: A progressive corner-cutting method for multiple sequence alignment.

[BibT_eX]

[DOI]

BMC Bioinform., 2010

Bayesian sampling of genomic rearrangement scenarios via double cut and join.

[BibT_eX]

[DOI]

Bioinform., 2010

2008

Statistical Multiple Alignment.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

How reliably can we predict the reliability of protein structure predictions?

[BibT_eX]

[DOI]

BMC Bioinform., 2008

StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary trees.

[BibT_eX]

[DOI]

Bioinform., 2008

2007

SimulFold: Simultaneously Inferring RNA Structures Including Pseudoknots, Alignments, and Trees Using a Bayesian MCMC Framework.

[BibT_eX]

[DOI]

Irmtraud M. Meyer

PLoS Comput. Biol., 2007

2006

Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC.

[BibT_eX]

[DOI]

Timothy Brooks Paige

Péter Ligeti

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer.

[BibT_eX]

[DOI]

Miklós Csürös

Proceedings of the Research in Computational Molecular Biology, 2006

2005

A linear memory algorithm for Baum-Welch training.

[BibT_eX]

[DOI]

Irmtraud M. Meyer

BMC Bioinform., 2005

Bayesian coestimation of phylogeny and sequence alignment.

[BibT_eX]

[DOI]

BMC Bioinform., 2005

ParIS Genome Rearrangement server.

[BibT_eX]

[DOI]

Péter Ittzés

Jotun Hein

Bioinform., 2005

2004

Genome Rearrangement in Mitochondria and Its Computational Biology.

[BibT_eX]

[DOI]

Jotun Hein

Proceedings of the Comparative Genomics, 2004

2003

An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

MCMC genome rearrangement.

[BibT_eX]

Proceedings of the European Conference on Computational Biology (ECCB 2003), 2003

2001

An Improved Model for Statistical Alignment.

[BibT_eX]

[DOI]