The following pages link to István Miklós (Q253273):
Displaying 8 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)
- 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)
