István Miklós

According to our database1, István Miklós authored at least 46 papers between 2001 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Counting Maximum Matchings in Planar Graphs Is Hard.
CoRR, 2020

Packing tree degree sequences.
Informatica (Slovenia), 2019

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

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

The computational complexity of calculating partition functions of optimal medians with Hamming distance.
Adv. Appl. Math., 2019

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

New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling.
Combinatorics, Probability & Computing, 2018

Half-regular factorizations of the complete bipartite graph.
Discret. Appl. Math., 2017

Graph Realizations Constrained by Skeleton Graphs.
Electr. J. Comb., 2017

Statistical Multiple Alignment.
Encyclopedia of Algorithms, 2016

Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071).
Dagstuhl Reports, 2016

The second order degree sequence problem is NP-complete.
CoRR, 2016

A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix.
SIAM J. Discrete Math., 2015

On realizations of a joint degree matrix.
Discret. Appl. Math., 2015

Approximate statistical alignment by iterative sampling of substitution matrices.
CoRR, 2015

Exact sampling of graphs with prescribed degree correlations.
CoRR, 2015

Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphs.
BMC Bioinformatics, 2015

Counting and sampling SCJ small parsimony solutions.
Theor. Comput. Sci., 2014

Modulated string searching.
Theor. Comput. Sci., 2014

Information Extraction from Hungarian, English and German CVs for a Career Portal.
Proceedings of the Mining Intelligence and Knowledge Exploration, 2014

On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.
Combinatorics, Probability & Computing, 2013

On sampling SCJ rearrangement scenarios
CoRR, 2013

Proving the Pressing Game Conjecture on Linear Graphs
CoRR, 2013

Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence.
Electr. J. Comb., 2013

Approximating the number of Double Cut-and-Join scenarios.
Theor. Comput. Sci., 2012

Positive Evolutionary Selection of an HD Motif on Alzheimer Precursor Protein Orthologues Suggests a Functional Role.
PLoS Computational Biology, 2012

The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

MCMC Network: Graphical Interface for Bayesian Analysis of Metabolic Networks.
ERCIM News, 2010

A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs.
Electr. J. Comb., 2010

Reticular Alignment: A progressive corner-cutting method for multiple sequence alignment.
BMC Bioinformatics, 2010

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

Statistical Multiple Alignment.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

How reliably can we predict the reliability of protein structure predictions?
BMC Bioinformatics, 2008

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

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

Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer.
Proceedings of the Research in Computational Molecular Biology, 2006

A linear memory algorithm for Baum-Welch training.
BMC Bioinformatics, 2005

Bayesian coestimation of phylogeny and sequence alignment.
BMC Bioinformatics, 2005

ParIS Genome Rearrangement server.
Bioinformatics, 2005

Genome Rearrangement in Mitochondria and Its Computational Biology.
Proceedings of the Comparative Genomics, 2004

An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees.
Journal of Computational Biology, 2003

Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution.
Discret. Appl. Math., 2003

Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

MCMC genome rearrangement.
Proceedings of the European Conference on Computational Biology (ECCB 2003), 2003

An Improved Model for Statistical Alignment.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001