The number of clone orderings
From MaRDI portal
Publication:1923582
DOI10.1016/0166-218X(96)00093-5zbMath0861.05005OpenAlexW2089833774MaRDI QIDQ1923582
Publication date: 4 May 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematics for the Analysis of Algorithms.
- Mapping DNA by stochastic relaxation
- Some methods for computing component distribution probabilities in relational structures
- Multiple solutions of DNA restriction mapping problems
- A lower bound on the number of solutions to the probed partial digest problem
- Physical mapping of chromosomes: A combinatorial problem in molecular biology
- The Computation of Catalan Numbers
- Asymptotic Methods in Enumeration
- Catalan Strikes Again! How Likely Is a Function to Be Convex?
- Historical Note on a Recurrent Combinatorial Problem
- Correspondences between plane trees and binary sequences
This page was built for publication: The number of clone orderings