<--- Back to Details
First PageDocument Content
NP-complete problems / Tree / Feedback vertex set / Approximation algorithm / Binary tree / Directed acyclic graph / Directed graph / Graph coloring / Minimum spanning tree / Graph theory / Theoretical computer science / Mathematics
NP-complete problems
Tree
Feedback vertex set
Approximation algorithm
Binary tree
Directed acyclic graph
Directed graph
Graph coloring
Minimum spanning tree
Graph theory
Theoretical computer science
Mathematics

SCOWLP update: 3D classification of protein-protein, -peptide, -saccharide and -nucleic acid interactions, and structure-based binding inferences across folds

Add to Reading List

Source URL: www.ncbi.nlm.nih.gov

Download Document from Source Website

File Size: 338,67 KB

Share Document on Facebook

Similar Documents

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

DocID: 1rmNc - View Document

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

DocID: 1qU2V - View Document

Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo  Elad Verbin

Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo Elad Verbin

DocID: 1qJ8t - View Document

Evaluating TOP-K Queries Over Business Processes Daniel Deutch, Tova Milo Tel Aviv University {danielde,milo}@post.tau.ac.il  Abstract— A Business Process (BP) consists of some business

Evaluating TOP-K Queries Over Business Processes Daniel Deutch, Tova Milo Tel Aviv University {danielde,milo}@post.tau.ac.il Abstract— A Business Process (BP) consists of some business

DocID: 1qIGc - View Document

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

DocID: 1qy6z - View Document