# Exhaustive Type Definition and Explanation PDF Download

Learn *Exhaustive Type* definition in bioinformatics with explanation to study “What is Exhaustive Type”. Study exhaustive type explanation with bioinformatics terms to review bioinformatics course for online degree programs.

## Exhaustive Type Definition:

Algorithm to find the best or exact solution for a particular problem by examining all mathematical combinations.

Essential Bioinformatics by Jin Xiong

## Exhaustive Type Explanation:

The algorithm that checks all the possible solutions of a specific problem and identifies the most optimal and perfect solution. The exhausitve algorithm is known as brute force algorithm, it is time consuming algorithm as it tries a large number of choices.

### Keep Learning Bioinformatics Explanations

#### What is Homoplasy?

A homoplasy is a shared trait between set of species in separate lineages i.e. that trait does not found in ...

#### What is Cytologic Map?

The cytologic map is the way of determining position of genes on a chromosome on the basis of test cross ...

#### What is Interologs?

If a pair of conserved protein in one specie interact with their homolgs in other specie then it is known ...

#### What is Dichotomy?

In a phylogenetic tree, if all the nodes in a tree have two descendent lineages, then the tree is known ...

#### What is Hyperplane?

Hyperplane is a mathematical approach that identifies the true positive results and reduces the false positive result ...

#### What is Motif?

A motif is a short conserved sequence pattern among different species that perform a similar function. For example, a helix-turn-helix ...