Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
István Miklós
2010 – today
- 2013
[j17]István Miklós, Péter L. Erdös, Lajos Soukup: Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence. Electr. J. Comb. 20(1): P16 (2013)- [j16]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. Combinatorics, Probability & Computing 22(3): 366-383 (2013)
- [i6]Alberto Apostolico, Péter L. Erdös, István Miklós, Johannes Siemons: Modulated String Searching. CoRR abs/1302.3437 (2013)
- [i5]É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)
- [i4]Eliot Bixby, Toby Flint, István Miklós: Proving the Pressing Game Conjecture on Linear Graphs. CoRR abs/1303.6799 (2013)
- [i3]István Miklós, Sándor Z. Kiss, Eric Tannier: On sampling SCJ rearrangement scenarios. CoRR abs/1304.2170 (2013)
- 2012
- [j15]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 Computational Biology 8(2) (2012)
- [j14]István Miklós, Eric Tannier: Approximating the number of Double Cut-and-Join scenarios. Theor. Comput. Sci. 439: 30-40 (2012)
- [i2]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
- [j13]István Miklós, Eric Tannier: Bayesian sampling of genomic rearrangement scenarios via double cut and join. Bioinformatics 26(24): 3012-3019 (2010)
- [j12]Adrienn Szabo, Ádám Novák, István Miklós, Jotun Hein: Reticular Alignment: A progressive corner-cutting method for multiple sequence alignment. BMC Bioinformatics 11: 570 (2010)
- [j11]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. Electr. J. Comb. 17(1) (2010)
- [j10]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)
- [j9]István Miklós, Bence Melykuti, Krister M. Swenson: The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 763-767 (2010)
2000 – 2009
- 2009
- [e1]Francesca Ciccarelli, István Miklós (Eds.): 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
- 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. Bioinformatics 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 Bioinformatics 9 (2008)
- [r1]
- 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 Computational Biology 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. Bioinformatics 21(6): 817-820 (2005)
- [j4]Gerton Lunter, István Miklós, Alexei Drummond, Jens Ledet Jensen, Jotun Hein: Bayesian coestimation of phylogeny and sequence alignment. BMC Bioinformatics 6: 83 (2005)
- [j3]István Miklós, Irmtraud M. Meyer: A linear memory algorithm for Baum-Welch training. BMC Bioinformatics 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. Discrete Applied Mathematics 127(1): 79-84 (2003)
- [j1]Gerton Lunter, István Miklós, Yun S. Song, Jotun Hein: An Efficient Algorithm for Statistical Multiple Alignment on Arbitrary Phylogenetic Trees. Journal of Computational Biology 10(6): 869-889 (2003)
- [c3]
- [c2]Gerton Lunter, István Miklós, Alexei Drummond, Jens Ledet Jensen, Jotun Hein: Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model. WABI 2003: 228-244
- 2001
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:41 CEST by the dblp team