Pages that link to "Item:Q433111"
From MaRDI portal
The following pages link to On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111):
Displaying 5 items.
- Solving the maximum weighted clique problem based on parallel biological computing model (Q1665198) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- Global weak solutions in three space dimensions for electrokinetic flow processes (Q2397414) (← links)
- The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562) (← links)
- Asymptotic models for transport in large aspect ratio nanopores (Q5205837) (← links)