The following pages link to István Miklós (Q253273):
Displaying 35 items.
- An improved algorithm for statistical alignment of sequences related by a star tree (Q253274) (← links)
- Moments of the Boltzmann distribution for RNA secondary structures (Q263518) (← links)
- Approximating the number of double cut-and-join scenarios (Q441869) (← links)
- On realizations of a joint degree matrix (Q479053) (← links)
- Counting and sampling SCJ small parsimony solutions (Q740977) (← links)
- Proving the pressing game conjecture on linear graphs (Q903135) (← links)
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs (Q976717) (← links)
- The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451) (← links)
- Not all simple looking degree sequence problems are easy (Q1750667) (← links)
- Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution (Q1868713) (← links)
- Towards random uniform sampling of bipartite graphs with given degree sequence (Q1953395) (← links)
- Half-graphs, other non-stable degree sequences, and the switch Markov chain (Q2040004) (← links)
- Packing tree degree sequences (Q2175807) (← links)
- Edge disjoint caterpillar realizations (Q2217488) (← links)
- The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
- Graph realizations constrained by skeleton graphs (Q2363110) (← links)
- Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
- Modulated string searching (Q2437743) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences (Q2696614) (← links)
- A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer (Q3596309) (← links)
- Degree-based graph construction (Q3650407) (← links)
- New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling (Q4643313) (← links)
- Computational Complexity of Counting and Sampling (Q4685131) (← links)
- An Improved Model for Statistical Alignment (Q4801133) (← links)
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence (Q4921567) (← links)
- Exact sampling of graphs with prescribed degree correlations (Q5151598) (← links)
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)
- Comparative Genomics (Q5492799) (← links)
- Approximate sampling of graphs with near-\(P\)-stable degree intervals (Q6192073) (← links)
- Constructing, sampling and counting graphical realizations of restricted degree sequences (Q6239226) (← links)
- Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences (Q6294856) (← links)
- Mixing time of the swap Markov chain and \(P\)-stability (Q6621197) (← links)
- Fully graphic degree sequences and P-stable degree sequences (Q6655400) (← links)
- A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality (Q6755584) (← links)
