From post

Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC.

, , и . WABI, том 4175 из Lecture Notes in Computer Science, стр. 174-185. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Graph Realizations Constrained by Skeleton Graphs., , , и . Electron. J. Comb., 24 (2): 2 (2017)Modulated String Searching, , , и . CoRR, (2013)MCMC genome rearrangement.. ECCB, стр. 130-137. (2003)The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths., , и . IEEE ACM Trans. Comput. Biol. Bioinform., 7 (4): 763-767 (2010)A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs., , и . Electron. J. Comb., (2010)Bayesian sampling of genomic rearrangement scenarios via double cut and join., и . Bioinform., 26 (24): 3012-3019 (2010)An Improved Model for Statistical Alignment., и . WABI, том 2149 из Lecture Notes in Computer Science, стр. 1-10. Springer, (2001)Information Extraction from Hungarian, English and German CVs for a Career Portal., , , , , , и . MIKE, том 8891 из Lecture Notes in Computer Science, стр. 333-341. Springer, (2014)Genome Rearrangement in Mitochondria and Its Computational Biology., и . Comparative Genomics, том 3388 из Lecture Notes in Computer Science, стр. 85-96. Springer, (2004)How reliably can we predict the reliability of protein structure predictions?, , , и . BMC Bioinform., (2008)