Skip to main content
Figure 1 | BMC Bioinformatics

Figure 1

From: A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences

Figure 1

Work flow of the conservation score implementation. The conservation score is implemented as a Web Service (light grey) with two embedded Web Services (dark grey). It takes as input a protein sequence and gives as output the list of all the predicted instances with their positions and conservation scores. The Bergen University Web Service finds all the matches for ELM regular expressions in the query sequence. The EBI Web Service does the BLAST search, the multiple alignment and the phylogenetic tree calculation. The three main steps of the core algorithm are highlighted with black boxes.

Back to article page