default search action
István Miklós
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j34]Péter L. Erdös
, István Miklós, Lajos Soukup:
Fully graphic degree sequences and P-stable degree sequences. Adv. Appl. Math. 163: 102805 (2025) - 2024
- [i25]Péter L. Erdös, István Miklós, Lajos Soukup:
Fully graphic degree sequences and P-stable degree sequences. CoRR abs/2405.12013 (2024) - 2023
- [j33]Letong Hong
A Markov chain on the solution space of edge colorings of bipartite graphs. Discret. Appl. Math. 332: 7-22 (2023) - [j32]Uros Cibej, Aaron Li
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. Discret. Appl. Math. 332: 47-61 (2023) - [i24]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 abs/2308.13251 (2023) - [i23]Runze Li, István Miklós:
Dense, irregular, yet always graphic 3-uniform hypergraph degree sequences. CoRR abs/2312.00555 (2023) - [i22]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): 49-73 (2023) - 2022
- [j31]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: 103421 (2022) - [i21]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 abs/2204.09493 (2022) - 2021
- [j30]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): 3 (2021) - [j29]István Miklós, Geneva Schlafly, Yuheng Wang, Zhangyang Wei
Edge disjoint caterpillar realizations. Discret. Appl. Math. 289: 327-344 (2021) - [i20]István Miklós, Cordian Riener:
#P-hardness proofs of matrix immanants evaluated on restricted matrices. CoRR abs/2103.04934 (2021) - [i19]Letong Hong, István Miklós:
A Markov chain on the solution space of edge-colorings of bipartite graphs. CoRR abs/2103.11990 (2021) - [i18]Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth:
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. CoRR abs/2109.12993 (2021) - 2020
- [j28]Aravind Gollakota, Will Hardt, István Miklós:
Packing Tree Degree Sequences. Graphs Comb. 36(3): 779-801 (2020)
2010 – 2019
- 2019
- [j27]István Miklós, Heather C. Smith:
The computational complexity of calculating partition functions of optimal medians with Hamming distance. Adv. Appl. Math. 102: 18-82 (2019) - [j26]Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós:
Packing tree degree sequences. Informatica (Slovenia) 43(1) (2019) - [i17]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 abs/1903.06600 (2019) - [i16]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 abs/1909.02308 (2019) - 2018
- [j25]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): 186-207 (2018) - [i15]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): 1-20 (2018) - 2017
- [j24]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): 2 (2017) - [j23]Mark Aksen
Half-regular factorizations of the complete bipartite graph. Discret. Appl. Math. 230: 21-33 (2017) - 2016
- [r2]István Miklós:
Statistical Multiple Alignment. Encyclopedia of Algorithms 2016: 2086-2090 - [i14]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 abs/1601.08224 (2016) - [i13]Péter L. Erdös, István Miklós:
The second order degree sequence problem is NP-complete. CoRR abs/1606.00730 (2016) - [i12]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): 65-77 (2016) - 2015
- [j22]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: 108:1-108:26 (2015) - [j21]István Miklós, Heather C. Smith:
Sampling and counting genome rearrangement scenarios. BMC Bioinform. 16(S14): S6 (2015) - [j20]Éva Czabarka
On realizations of a joint degree matrix. Discret. Appl. Math. 181: 283-288 (2015) - [j19]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): 481-499 (2015) - [i11]Joseph L. Herman, Adrienn Szabó, István Miklós, Jotun Hein:
Approximate statistical alignment by iterative sampling of substitution matrices. CoRR abs/1501.04986 (2015) - [i10]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 abs/1503.06725 (2015) - [i9]István Miklós, Heather C. Smith:
The computational complexity of calculating partition functions of optimal medians with Hamming distance. CoRR abs/1506.06107 (2015) - 2014
- [j18]Alberto Apostolico, Péter L. Erdös
Modulated string searching. Theor. Comput. Sci. 525: 23-29 (2014) - [j17]István Miklós, Sándor Z. Kiss, Eric Tannier:
Counting and sampling SCJ small parsimony solutions. Theor. Comput. Sci. 552: 83-98 (2014) - [c7]Richárd Farkas
Information Extraction from Hungarian, English and German CVs for a Career Portal. MIKE 2014: 333-341 - 2013
- [j16]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): 16 (2013) - [j15]Péter L. Erdös, Zoltán Király
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence. Comb. Probab. Comput. 22(3): 366-383 (2013) - [i8]Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons:
Modulated String Searching. CoRR abs/1302.3437 (2013) - [i7]Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós:
On Realizations of a Joint Degree Matrix. CoRR abs/1302.3548 (2013) - [i6]Eliot Bixby, Toby Flint, István Miklós:
Proving the Pressing Game Conjecture on Linear Graphs. CoRR abs/1303.6799 (2013) - [i5]István Miklós, Sándor Z. Kiss, Eric Tannier:
On sampling SCJ rearrangement scenarios. CoRR abs/1304.2170 (2013) - [i4]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 abs/1307.5295 (2013) - 2012
- [j14]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) - [j13]István Miklós, Eric Tannier:
Approximating the number of Double Cut-and-Join scenarios. Theor. Comput. Sci. 439: 30-40 (2012) - [i3]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 abs/1205.2842 (2012) - 2010
- [j12]István Miklós, Eric Tannier:
Bayesian sampling of genomic rearrangement scenarios via double cut and join. Bioinform. 26(24): 3012-3019 (2010) - [j11]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: 570 (2010) - [j10]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) - [j9]István Miklós, Bence Mélykúti
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 763-767 (2010) - [i2]Eszter Friedman, István Miklós, Jotun Hein:
MCMC Network: Graphical Interface for Bayesian Analysis of Metabolic Networks. ERCIM News 2010(82): 31-32 (2010)
2000 – 2009
- 2009
- [e1]Francesca D. Ciccarelli, István Miklós:
Comparative Genomics, International Workshop, RECOMB-CG 2009, Budapest, Hungary, September 27-29, 2009. Proceedings. Lecture Notes in Computer Science 5817, Springer 2009, ISBN 978-3-642-04743-5 [contents] - 2008
- [j8]Á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): 2403-2404 (2008) - [j7]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) - [r1]István Miklós:
Statistical Multiple Alignment. Encyclopedia of Algorithms 2008 - 2007
- [j6]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) - 2006
- [c6]Miklós Csürös, István Miklós:
A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer. RECOMB 2006: 206-220 - [c5]István Miklós, Timothy Brooks Paige, Péter Ligeti:
Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC. WABI 2006: 174-185 - 2005
- [j5]István Miklós, Péter Ittzés, Jotun Hein:
ParIS Genome Rearrangement server. Bioinform. 21(6): 817-820 (2005) - [j4]Gerton Lunter
Bayesian coestimation of phylogeny and sequence alignment. BMC Bioinform. 6: 83 (2005) - [j3]István Miklós, Irmtraud M. Meyer:
A linear memory algorithm for Baum-Welch training. BMC Bioinform. 6: 231 (2005) - [i1]István Miklós, Irmtraud M. Meyer:
A linear memory algorithm for Baum-Welch training. CoRR abs/cs/0505028 (2005) - 2004
- [c4]István Miklós, Jotun Hein:
Genome Rearrangement in Mitochondria and Its Computational Biology. Comparative Genomics 2004: 85-96 - 2003
- [j2]István Miklós:
Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution. Discret. Appl. Math. 127(1): 79-84 (2003) - [j1]Gerton Lunter
An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees. J. Comput. Biol. 10(6): 869-889 (2003) - [c3]István Miklós:
MCMC genome rearrangement. ECCB 2003: 130-137 - [c2]Gerton Lunter, István Miklós, Alexei J. Drummond, Jens Ledet Jensen
Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model. WABI 2003: 228-244 - 2001
- [c1]István Miklós, Zoltán Toroczkai
An Improved Model for Statistical Alignment. WABI 2001: 1-10
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: