István Miklós

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 32

Top Topics

Transition Probabilities

Bipartite Graph

Monte Carlo Method

Top Venues

Discret. Appl. Math.

Dagstuhl Reports

Publications

Péter L. Erdös, István Miklós, Lajos Soukup
Fully graphic degree sequences and P-stable degree sequences. CoRR (2024)
Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. Discret. Appl. Math. 332 (2023)
Andras Hubai, Tamás Róbert Mezei, Ferenc Béres, András Benczúr, István Miklós
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence. CoRR (2023)
Letong Hong, István Miklós
A Markov chain on the solution space of edge colorings of bipartite graphs. Discret. Appl. Math. 332 (2023)
Runze Li, István Miklós
Dense, irregular, yet always graphic 3-uniform hypergraph degree sequences. CoRR (2023)
David I. Bevan, Miklós Bóna, István Miklós
Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121). Dagstuhl Reports 13 (3) (2023)
Péter L. Erdös, Tamás Róbert Mezei, István Miklós
Approximate Sampling of Graphs with Near-P-stable Degree Intervals. CoRR (2022)
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
The mixing time of switch Markov chains: A unified approach. Eur. J. Comb. 99 (2022)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. Electron. J. Comb. 28 (3) (2021)
István Miklós, Geneva Schlafly, Yuheng Wang, Zhangyang Wei
Edge disjoint caterpillar realizations. Discret. Appl. Math. 289 (2021)
Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. CoRR (2021)
István Miklós, Cordian Riener
#P-hardness proofs of matrix immanants evaluated on restricted matrices. CoRR (2021)
Letong Hong, István Miklós
A Markov chain on the solution space of edge-colorings of bipartite graphs. CoRR (2021)
Aravind Gollakota, Will Hardt, István Miklós
Packing Tree Degree Sequences. Graphs Comb. 36 (3) (2020)
István Miklós, Heather C. Smith
The computational complexity of calculating partition functions of optimal medians with Hamming distance. Adv. Appl. Math. 102 (2019)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. CoRR (2019)
Péter L. Erdös, Catherine S. Greenhill, Tamás Róbert Mezei, István Miklós, Daniel Soltész, Lajos Soukup
The mixing time of the swap (switch) Markov chains: a unified approach. CoRR (2019)
Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós
Packing tree degree sequences. Informatica (Slovenia) 43 (1) (2019)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling. Comb. Probab. Comput. 27 (2) (2018)
Michael Albert, David I. Bevan, Miklós Bóna, István Miklós
Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451). Dagstuhl Reports 8 (11) (2018)
Péter L. Erdös, Stephen G. Hartke, Leo van Iersel, István Miklós
Graph Realizations Constrained by Skeleton Graphs. Electron. J. Comb. 24 (2) (2017)
Mark Aksen, István Miklós, Kathleen Zhou
Half-regular factorizations of the complete bipartite graph. Discret. Appl. Math. 230 (2017)
Michael Albert, Miklós Bóna, István Miklós, Einar Steingrímsson
Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071). Dagstuhl Reports 6 (2) (2016)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
New classes of degree sequences with fast mixing swap Markov chain sampling. CoRR (2016)
Péter L. Erdös, István Miklós
The second order degree sequence problem is NP-complete. CoRR (2016)
István Miklós, Heather C. Smith
Sampling and counting genome rearrangement scenarios. BMC Bioinform. 16 (S14) (2015)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. SIAM J. Discret. Math. 29 (1) (2015)
István Miklós, Heather C. Smith
The computational complexity of calculating partition functions of optimal medians with Hamming distance. CoRR (2015)
Kevin E. Bassler, Charo I. Del Genio, Péter L. Erdös, István Miklós, Zoltán Toroczkai
Exact sampling of graphs with prescribed degree correlations. CoRR (2015)
Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
On realizations of a joint degree matrix. Discret. Appl. Math. 181 (2015)
Joseph L. Herman, Adrienn Szabó, István Miklós, Jotun Hein
Approximate statistical alignment by iterative sampling of substitution matrices. CoRR (2015)
Joseph L. Herman, Ádám Novák, Rune B. Lyngsø, Adrienn Szabó, István Miklós, Jotun Hein
Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphs. BMC Bioinform. 16 (2015)
István Miklós, Sándor Z. Kiss, Eric Tannier
Counting and sampling SCJ small parsimony solutions. Theor. Comput. Sci. 552 (2014)
Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
Modulated string searching. Theor. Comput. Sci. 525 (2014)
Richárd Farkas, András Dobó, Zoltán Kurai, István Miklós, Ágoston Nagy, Veronika Vincze, János Zsibrita
Information Extraction from Hungarian, English and German CVs for a Career Portal. MIKE (2014)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix. CoRR (2013)
István Miklós, Sándor Z. Kiss, Eric Tannier
On sampling SCJ rearrangement scenarios CoRR (2013)
Eliot Bixby, Toby Flint, István Miklós
Proving the Pressing Game Conjecture on Linear Graphs CoRR (2013)
Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós
On Realizations of a Joint Degree Matrix CoRR (2013)
István Miklós, Péter L. Erdös, Lajos Soukup
Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. Electron. J. Comb. 20 (1) (2013)
Péter L. Erdös, Zoltán Király, István Miklós
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. Comb. Probab. Comput. 22 (3) (2013)
Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons
Modulated String Searching CoRR (2013)
István Miklós, Eric Tannier
Approximating the number of Double Cut-and-Join scenarios. Theor. Comput. Sci. 439 (2012)
István Miklós, Zoltán Zádori
Positive Evolutionary Selection of an HD Motif on Alzheimer Precursor Protein Orthologues Suggests a Functional Role. PLoS Comput. Biol. 8 (2) (2012)
Péter L. Erdös, Zoltán Király, István Miklós
On the swap-distances of different realizations of a graphical degree sequence CoRR (2012)
Adrienn Szabó, Ádám Novák, István Miklós, Jotun Hein
Reticular Alignment: A progressive corner-cutting method for multiple sequence alignment. BMC Bioinform. 11 (2010)
Péter L. Erdös, István Miklós, Zoltán Toroczkai
A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs. Electron. J. Comb. 17 (1) (2010)
István Miklós, Bence Mélykúti, Krister M. Swenson
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (4) (2010)
István Miklós, Eric Tannier
Bayesian sampling of genomic rearrangement scenarios via double cut and join. Bioinform. 26 (24) (2010)
Eszter Friedman, István Miklós, Jotun Hein
MCMC Network: Graphical Interface for Bayesian Analysis of Metabolic Networks. ERCIM News 2010 (82) (2010)
István Miklós, Ádám Novák, Balázs Dombai, Jotun Hein
How reliably can we predict the reliability of protein structure predictions? BMC Bioinform. 9 (2008)
Ádám Novák, István Miklós, Rune B. Lyngsø, Jotun Hein
StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary trees. Bioinform. 24 (20) (2008)
Irmtraud M. Meyer, István Miklós
SimulFold: Simultaneously Inferring RNA Structures Including Pseudoknots, Alignments, and Trees Using a Bayesian MCMC Framework. PLoS Comput. Biol. 3 (8) (2007)
Miklós Csürös, István Miklós
A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer. RECOMB (2006)
István Miklós, Timothy Brooks Paige, Péter Ligeti
Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC. WABI (2006)
István Miklós, Irmtraud M. Meyer
A linear memory algorithm for Baum-Welch training. BMC Bioinform. 6 (2005)
Gerton Lunter, István Miklós, Alexei J. Drummond, Jens Ledet Jensen, Jotun Hein
Bayesian coestimation of phylogeny and sequence alignment. BMC Bioinform. 6 (2005)
István Miklós, Irmtraud M. Meyer
A linear memory algorithm for Baum-Welch training CoRR (2005)
István Miklós, Péter Ittzés, Jotun Hein
ParIS Genome Rearrangement server. Bioinform. 21 (6) (2005)
István Miklós, Jotun Hein
Genome Rearrangement in Mitochondria and Its Computational Biology. Comparative Genomics (2004)
István Miklós
MCMC genome rearrangement. ECCB (2003)
Gerton Lunter, István Miklós, Alexei J. Drummond, Jens Ledet Jensen, Jotun Hein
Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model. WABI (2003)
István Miklós
Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution. Discret. Appl. Math. 127 (1) (2003)
Gerton Lunter, István Miklós, Yun S. Song, Jotun Hein
An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees. J. Comput. Biol. 10 (6) (2003)
István Miklós, Zoltán Toroczkai
An Improved Model for Statistical Alignment. WABI (2001)