<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>An organizational environment for in silico experiments in molecular biology</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yuan Lin</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marie-Ang´elique Laporte</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lucile Soler</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Isabelle Mougenot</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Th´er`ese Libourel</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CIRAD-PERSYST, Campus International de Baillarguet</institution>
          ,
          <addr-line>34398 Montpellier cedex 5</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Centre d'Ecologie Fonctionnelle et Evolutive, UMR5175 CNRS</institution>
          ,
          <addr-line>1919, route de Mende, 34293 Montpellier, Cedex 5</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>LIRMM, UMR5506 CNRS-UM2</institution>
          ,
          <addr-line>161, rue Ada, 34095 Montpellier, Cedex 5</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>UMR ESPACE DEV IRD-UM2</institution>
          ,
          <addr-line>500 rue J.F. Breton, 34093 Montpellier, Cedex 5</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Molecular biologists, just like geneticists, make use of various experimental mechanisms and devices to conduct research and to validate or invalidate their theories or initial hypotheses. Mechanisms powered by information technology, called in silico, put data and analysis tools at the centre of the experiments, and are thus different from in vivo, ex vivo and in vitro mechanisms. Multiple resources (data sources as well as analysis tools) are widely available and, very often, allow various modes of operation, requiring certain expertise for their optimal use. This is especially true when drawing up complex analysis scenarios based on the sequential use of appropriate processing tools. To facilitate the construction of these experimentation mechanisms, we propose a scientific workflow infrastructure which uses an organizational environment to allow abstract planning of the experimentation, followed by its concretization. The concretization phase includes a verification of the conformity of the planned process chains composition to avoid any error during execution.</p>
      </abstract>
      <kwd-group>
        <kwd>Scientific workflow</kwd>
        <kwd>analysis pipeline</kwd>
        <kwd>specification language</kwd>
        <kwd>validation aspects of service composition</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Life sciences often rely on the chaining of data and application resources to
express the experimentation process. Valuable resources for biology, while
available in ever-increasing quantities, remain, for the most part, cost-expensive and
time-consuming to acquire and thus their reuse becomes almost a necessity.</p>
      <p>
        To design these complex experiments, scientists often need to locate suitable
resources and then to organize or reorganize them. In addition, each experiment
deserves to be saved so that it can be re-executed several times, either in various
different configurations or with diverse test data. In such a context, the use of
a scientific workflow proves to be an invaluable help. Several dedicated software
applications for this purpose now exist, most notably in the financial sector, and
research in the field is relatively advanced. A first study [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] presented our
approach based on the concept of the scientific workflow environment. Its objective
is to help the user to:
– design experimentation process chains (in as abstract a manner as possible),
– better organize resources (data and processes) which will be elements in the
concretization of these process chains,
– capitalize on the existing by constructing new processes from previously
devised experimentation plans.
      </p>
      <p>This article develops our research advances in terms of resource
organization and semi-automatic verification of validity of workflows designed within a
prototype.</p>
      <p>This article is structured as follows: section 2 presents a brief state of the
art, section 3 proposes an architecture for implementing a scientific workflow and
section 4 provides a glimpse of the organization brought about. Section 5 covers
the proposed verification of conformity, section 6 illustrates with an example
the validation of conformity of a concrete process chain, and section 7 presents
perspectives in progress.
2</p>
    </sec>
    <sec id="sec-2">
      <title>State of the art</title>
      <p>
        A study was conducted based on characteristics we deemed relevant [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]:
– The existence of a meta level for describing and creating process chains. In
fact, the generic aspect conferred by meta-modelling appears to be
fundamental for all of us.
– Taking the experimental aspect into account. The unique characteristics of
scientific data and processes should show through at the formalism level.
      </p>
      <p>
        We present here only two representative projects, Kepler[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and Taverna[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
which gain a certain amount of popularity among workflow scientists.
2.1
      </p>
      <sec id="sec-2-1">
        <title>KEPLER</title>
        <p>KEPLER 5 is a complete scientific workflow environment based on the Ptolemy
II platform of the University of Berkeley. As far as process chains are concerned,
5 http://kepler-project.org/
KEPLER adopts a human organization metaphor. It is Actor-Based and
considers all components of a process chain as actors. Actors (services) are accessed
via a structure corresponding to the business ontology of the concerned domain.</p>
        <p>The workflow is represented using a graphical language in the form of a
graph linking ports (input/output parameters) of actors via channels. One or
more actors in charge, Directors, plan tasks for other actors of the organization;
they do so based on the available ontology. The execution plan of a process chain
(or a portion of a process chain) is therefore created by a Director of the system.
Any necessary adaptations are achieved by intermediary sender and receiver
programs, which ensure the compatibility of data transferred over a channel.
The process chain is saved in the form of MoML (Modelling Markup Language)
files. (MoML is an XML-based language.) At the environment-interface level, a
specific zoom feature is associated with the concept of an opaque actor (cf. figure
1). An opaque actor appearing in a process chain can be opened, thus revealing
its constituent details.
Taverna is a workflow project created by the myGrid team in England and used
mainly in the life sciences. A workflow in Taverna is considered as a process
graph in which processes are connected by data links or control links. Processes
used are essentially web services (which can be supplemented by local libraries,
manuscript scripts, etc.). During process composition, the user manually couples
input/output parameters of web services or invokes shim services, specific
adaptors existing from couplings constructed and tested for experiments. In addition,
the process chain is saved in the form of a SCUFL (Simple Conceptual Unified
Flow Language) file. (SCUFL is an XML-based language.)
The Taverna and Kepler projects both provide generic models for instantiation
and composition of services. Additionally, some other approaches are also highly
relevant to scientific workflow management:
– The project BioMoby [17], as a first attempt to assist process chaining by
using scientific resources, which are described and classified in the MOBY
Central.
– PISE ans its revised system Mobyle [18] that provides a web environment
(a Web Portal) to define and execute bioinformatics analyses. Registered
analysis programs are pre-classified in a hierarchy, as well as some
frequentlyused workflows. Experts can easily find them by using the search function
panel that is integrated in the web site.
– The project ProtocolDB [19] proposed to model scientific workflows at two
different layers (design protocol/ implementation protocol). An
implementation protocol for a given design protocol is realized by mapping design tasks
to different implementation tasks (scientific resources like database queries/
tools), and by connecting them together.
– In [20–22], scientific workflow modeling is supported by resource discovery
approaches.</p>
        <p>In this manuscript we focus mainly on scientific workflows and the way they
are modeled and implemented. Our proposal introduces an additional level of
abstraction, whose purpose is to describe the business domain prior to
creating the process chains. This additional modelling level is predicted to facilitate
the construction of process chains by allowing biologists to use their expertise
of their domain, but without requiring them to have expert and often precise
knowledge of the underlying resources and their locations. It also plays the role
of a prescription model, to which instantiation and service composition models
have to conform.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Workflow architecture</title>
      <p>Our efforts have been guided by the business point of view, that of the
experimenters. Designing an experimental protocol corresponds to general model with
three stages: 1) Definition: abstract definition of a process chain corresponding
to an experimentation sequence (planning the experiments), 2) Instantiation:
a more specific definition after identifying the various elements of the chain
(data/processes), 3) Execution: customized execution (according to strategies
corresponding to the requirements).</p>
      <p>
        Based on this experimental life cycle, and inspired by the architectural styles
proposed by OMG [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], we propose the following 3-level architectural vision (cf.
figure 3):
      </p>
      <p>Business model ..... Business model</p>
      <sec id="sec-3-1">
        <title>Static</title>
        <p>Language used to define a
workflow business model
Business description
of the process chain Business model
Model instantiated
from a business model
Choice of the
execution strategy
Workflow Meta-Model</p>
        <p>Conforms
Instance of
.........</p>
        <p>Instantiated model
Instantiated model</p>
      </sec>
      <sec id="sec-3-2">
        <title>Intermediate</title>
        <p>Centralized / Decentralized execution</p>
      </sec>
      <sec id="sec-3-3">
        <title>Dynamic</title>
        <p>The static level concerns the design phase. It is a matter of constructing
(abstract) business-process models using a simple language. The intermediate
level represents an instantiation and pre-verification phase. Using the business
process model, the user constructs the real process chain by selecting and locating
the processes and data most appropriate to the planned experimentation. The
pre-verification is semi-automatized (cf. section 4). The dynamic level concerns
the actual execution phase. It takes place based on the various strategies defined
by both the user and the operational configurations.</p>
        <p>
          The static level has been studied in some detail in our [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]. We have
analyzed various language standards such as UML (activity diagram) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and SPEM
[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ], as also various existing projects such as BioSide [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], Meta-model WDO-It!
[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and CIMFlow [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Following this study, we proposed a simple but complete
language. It is based on a language defined by a meta-model whose abstract
elements, tasks or processes, are connected by unidirectional links and by the
intermediary of ports. To facilitate the manipulation of abstract process chains,
a corresponding graphical language was created within a prototype (cf. the top
part of the figure 4). By using this workflow definition language, a simple
example is modelled and shown in the lower part of the figure 4 6.
        </p>
        <p>Atomic task</p>
        <p>Task</p>
        <p>Role</p>
        <p>Role</p>
        <p>Proptpaeagingee
sequence</p>
        <p>Similarity search</p>
        <p>Data
Dpapatagagee
Aligpnpamagegenet</p>
        <p>Port (parameter)</p>
        <p>Data link</p>
        <p>data
1
2</p>
        <p>Visualization
Tree reconstruction
To carry out the experimental protocols, the abstract model instantiation stage
consists of finding and reusing existing resources. To facilitate this search, we
base ourselves on the concept of organizational environment. This environment
relies on the description of resources (data and processes) in the form of metadata
6 This example is also used in the later sections, we will explain it in detail during the
following sections.
(expressed in XML schema format). The resource descriptions are hierarchized
in resource categories and in concrete resources. As shown in figure 5, it consists
of:
– an organization relating to processes. It manages the hierarchy of
descriptions of process categories and of concrete processes. The concept of
Converter corresponds to the concept of a specific process responsible for
adapting data between different formats of the same data category.
– an organization relating to data. It manages a hierarchy of descriptions of
data categories, of concrete data and of the various associated data formats7.</p>
        <p>1
Organization of</p>
        <p>processes
specification
* *
Process
category</p>
        <p>Environment
linked to Concrete
1 * proces*s *
* InputCategories
* OutputCategories
*
*
Normal
process</p>
        <p>Converter
specification
* *</p>
        <p>Data
category 1</p>
        <p>linked to
InputFormats
OutputFormats</p>
        <p>1
Organization of
data
*
*
*</p>
        <p>*
Concrete</p>
        <p>data
is in 1
format</p>
        <p>sub format
1 1 1
Data format
*</p>
        <p>To illustrate this concept of the environment, we take an example from the
world of molecular biology (cf. figure 6). The upper part of each hierarchy
(processes and data) represent a set of categories (shown as ovals) sorted according
to the generalization/specialization relationship. The descriptions of concrete
resources (data or processes) are then associated to their category.</p>
        <p>The description of a concrete data describes its format, whereas that of a
concrete process corresponds to its signature, which we formalize thus:
Definition 1. Formalized signature of a concrete process
Name (Input parameter list) : (Output parameter list), where each parameter is
described by the doublet (Data category : data format).</p>
        <p>A set of data formats (Fasta, xml, MultiFasta, Clustal, Newick, Jpeg) is also
presented. Figure 6 is therefore complemented by the description of signatures
of some example concrete processes:
7 Remark: It should be noted that several data categories can share the same format.</p>
        <p>Blastp(ProteinSeq:Fasta) : (SeqPairs:xml)
ClustalW (ProteinDataBank:MultiFasta) : (MultipleAlignment:Clustal)
InteractiveSelection(SeqPairs:xml) : (ProteinDataBank:MultiFasta)
Logo(MultipleAlignment:Clustal) : (Image:jpeg)
PhyML(MultipleAlignment:Clustal) : (PhylogeneticTree:Newick)</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conformities</title>
      <sec id="sec-4-1">
        <title>The problem</title>
        <p>As already mentioned, the second important stage of the intermediate level
consists of validating the concrete model instantiated from the abstract model.</p>
        <p>Let us take an example described by using the workflow language,
corresponding to an abstract process chain model that a biologist designs with the
intention of characterizing a protein sequence which interests him in the context
of his putative functional domains.</p>
        <p>
          At the concrete level, the idea is to begin by using the Blast similarity-search
tool to compare the protein sequence under consideration with a data bank of
protein sequences and to thus identify segments with high similarity shared
both by the protein sequence under consideration and by various sequences in
the sequence data bank. These similar segments indicate the possible presence
of functional domains. The biologist then continues his study by reusing the
results output from the Blast tool [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], either to construct a phylogenetic tree
and retrace the evolutionary history of the sequence via the PhyML tool [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] or
to display the preserved positions common to all the similar segments via the
Logo tool [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. This simplified example of a process chain in molecular biology
allows us to highlight the difficulties encountered by the biologist in using the
results output by one tool as input to another tool. The difficulties relate, at the
same time, to the nature of the data (here characterized as data category), to the
format of this data, and, finally, to the biologists expertise. In the example, we
make willing use of the discrepancy which arises between the Blast tool, which
outputs a collection of simple alignments, and the PhyML and Logo tools, which
require multiple alignments to run. In fact, Blast leads to multiple discrepancies
two-by-two, involving the sequence under consideration and one of the sequences
from the sequence data bank which is similar to it; whereas PhyML and Logo
use the shared similarity by a set of sequences which includes the sequence under
consideration. This example highlights what we will subsequently term semantic
incompatibility.
        </p>
        <p>In its upper part, the figure 7 shows the abstract process chain and in
the lower the concrete chain obtained after locating data descriptions S1 and
adapted processes Blastp and PhyML. The problem which we designate as one
of validation of the instantiated (concrete) model consists of verifying the
compatibility of each composition. A composition corresponds to the link between an
output parameter p1 of a process T and an input parameter p2 of the process
following T; we denote it (p1 → p2).
5.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Identifying situations of compatibility</title>
        <p>Verification is undertaken by analyzing the signatures of linked processes. To do
so, we have to take two important aspects into account:
– The syntactic aspect : relating to the data formats used by the parameters.
– The semantic aspect : relating to the processs functionality. It not only
depends on the processs name but also on the signification of the input/output
parameters.</p>
        <p>For two processes T1(dc1:fo1) : (dc2:fo2, dc3:fo3) and T2(dc4:fo4) : (dc5:fo5),
let us suppose that there exists a composition, denoted p1→p2, between the p1
(dc3:fo3) output parameter of process T1 and the p2 (dc4:fo4) input parameter
of process T2.</p>
        <p>Syntactic and semantic compatibilities are defined as follows:
Definition 2. Syntactic compatibility</p>
        <p>p1 → p2 is syntactically compatible if (fo3 = fo4) ∨ (fo3 is a sub-format
of fo4), denoted p1 S→yn p2. Two parameters are syntactically compatible if they
use the same data format or if they use an output format which is a sub-format
of the input format. Else p1S9ynp2.</p>
        <p>Definition 3. Semantic compatibility</p>
        <p>p1 → p2 is semantically compatible if (dc3 = dc4) ∨ (dc3 is a sub-category
of dc4), denoted p1 Sem p2. Two parameters are semantically compatible if they
→
use the same category, or if they use an output category which is a sub-category
of the input category. Else p1S9emp2.</p>
        <p>The verification of a compositions compatibility is thus done at two levels:
syntactic and semantic. Three types of situations can arise:
– Situation 1 (p1 Sem p2) ∧ (p1 Syn p2): p1 and p2 are compatible at the
→ →
semantic and syntactic levels. This is the ideal situation in our context; we
designate it as valid.
– Situation 2 (p1 Sem p2) ∧ (p1 Syn p2): p1 and p2 are compatible at the
→ 9
semantic level but not at the syntactic level. The composition is syntactically
adaptable. An adaptation between the two data formats will be necessary
(cf. converters).
– Situation 3 p1 Sem p2 : The two parameters are not semantically compatible.</p>
        <p>9
In such a case, it is pointless to proceed to verify their syntactic compatibility
(in fact, for us, two parameters with different significations cannot be paired).
The composition is semantically adaptable.</p>
        <p>From these definitions, we develop our proposed approach for resolving the
incompatibilities.
6</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Validation of the experimental chain</title>
      <p>Of the three compatibility situations identified, the latter two require an
adaptation stage before going on to the execution phase. It is a matter of finding one
or more intermediate processes which can overcome the compositions
incompatibility. For situations 2 and 3, two types of adaptations are proposed:
– semantic adaptation (for situation 3). The incompatibility of situation 3
represents the case where the two parameters of a composition use
incompatible data categories. The adaptation here consists of finding a possible
intermediate process chain between these two categories.
– syntactic adaptation (for situation 2). In situation 2, where the composition
is already semantically compatible, the problem can be expressed as a
divergence between the data formats used by the two connected parameters.
All that is required is to find converters to convert one data format into the
other.</p>
      <p>These adaptations are based on the organizational environment. The search
for intermediate processes can be equated to a search for itineraries between
two incompatible data categories or formats. We will illustrate this using the
example and the organizational environment constructed earlier (cf. figure 6).</p>
      <p>Let us consider again the previous example. The verification conducted on
the instantiation of the abstract model detects a semantic incompatibility in the
composition between Blastp and Logo or between Blastp and PhyML due to
difference in categories Pairs of sequences and Multiple Alignment (Incompatibility
situation 3 ). The (semantic) adaptation will be applied; it consists of finding in
what we call the (semantic) resource graph the path allowing the conversion of
categories.</p>
      <p>The construction of the (semantic) resource graph consists of extracting,
from the organizational environment, the descriptions of processes and of data
categories referenced by their parameters. Such a (semantic) resource graph
generated from the environment described in the figure 6 is shown in the figure 8.</p>
      <p>A graph traversal algorithm is used to find all the possible paths between
the two concerned data categories (Pairs of sequences and Multiple Alignment ).
A single path is found in the graph: Pairs of sequences → InteractiveSelection
→ ProteinDataBank → ClustalW → Multiple Alignment. The two processes,
InteractiveSelection and ClustalW, will therefore be added to the incompatible
chain (cf. figure 9).</p>
      <p>Once this adaptation is done, there still remains the existing syntactic
incompatibility of the composition between the InteractiveSelection and ClustalW
processes because even though InteractiveSelection outputs the same data
category that is accepted for input by ClustalW, their data formats are different (xml
and MultiFasta). Syntactic adaptation consists of finding specific converters, or
compositions of converters, necessary for these conversions. We will not cover
this stage in detail; it is simply enough to understand that converters (or their
composition) can be added to obtain the required validity.
7</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion and perspectives</title>
      <p>
        A prototype (http://www.lirmm.fr/ lin/project/) illustrating the key aspects of
our approach for designing and validating scientific process chains is currently
being developed. This prototype serves as a basis for an inductive
experimental approach using data of BAC and EST nucleic sequences as well as physical
and genetic maps for identifying and characterizing genetic markers relating to
sex of the Nile tilapia (Oreochromis niloticus). Over a longer term, we intend
to integrate the current prototype into a platform with a search engine based
on resource descriptions to be able to undertake the execution using real
resources, after requisite validation of experimentation chain. It will eventually
also use open-source controlled vocabularies such as PFO (Protein Feature
Ontology)[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], SO (Sequence Ontology)[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], and GO (Gene Ontology)[16] to enrich
data categories by additional representations and thus extend the descriptive
capacities of the organizational environment.
16. M.Ashburner, C.A. Ball, J.A. Blake, D.Botstein, H.Butler, J. Michael Cherry, A.P.
      </p>
      <p>Davis, K.Dolinski, S.S. Dwight, J.T. Eppig, M.A. Harris, D.P. Hill, L.Issel-Tarver,
A.Kasarskis, S.Lewis, J.C. Matese, J. E. Richardson, M.Ringwald, G.M. Rubin,
G.Sherlock, Gene ontology: tool for the unification of biology. The Gene Ontology
Consortium. In Nature Genetics, vol 25, pages 25-29, 2000.
17. Michael DiBernardo, Rachel Pottinger, Mark Wilkinson: Semi-automatic web
service composition for the life sciences using the BioMoby semantic web framework.</p>
      <p>Journal of Biomedical Informatics 41(5): 837-847 (2008).
18. Bertrand N´eron, Herv´e M´enager, Corinne Maufrais, Nicolas Joly, Julien Maupetit,
S´ebastien Letort, S´ebastien Carr`ere, Pierre Tuff´ery, Catherine Letondal: Mobyle: a
new full web bioinformatics framework. Bioinformatics 25(22): 3005-3011 (2009).
19. Michel Kinsy, Zo´e Lacroix, Christophe Legendre, Piotr Wlodarczyk, Nadia Yacoubi
Ayadi: ProtocolDB: Storing Scientific Protocols with a Domain Ontology. WISE
Workshops 2007: 17-28
20. Zo´e Lacroix: Resource Discovery, Second International Workshop, RED 2009,</p>
      <p>Lyon, France, August 28, 2009. Revised Papers Springer 2010.
21. Zo´e Lacroix, Cartik R. Kothari, Peter Mork, Rami Rifaieh, Mark Wilkinson,
Juliana Freire, Sarah Cohen Boulakia: Biological Resource Discovery. Encyclopedia
of Database Systems 2009: 220-223.
22. Nadia Yacoubi Ayadi, Zo´e Lacroix, Maria-Esther Vidal: A Deductive Approach
for Resource Interoperability and Well-Defined Workflows. OTM Workshops 2008:
998-1009.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>I.</given-names>
            <surname>Altintas</surname>
          </string-name>
          , B. Lud¨ascher, S. Klasky, and
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Vouk.</surname>
          </string-name>
          S04
          <article-title>- introduction to scientific workflow management and the kepler system</article-title>
          .
          <source>In SC, page 205</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>S.</given-names>
            <surname>Altschul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Gish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Myers</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Lipman</surname>
          </string-name>
          .
          <article-title>Basic local alignment search tool</article-title>
          .
          <source>In Journal of Molecular Biology</source>
          , vol
          <volume>215</volume>
          , pages
          <fpage>403</fpage>
          -
          <lpage>410</lpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>S.</given-names>
            <surname>Guindon</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Gascuel</surname>
          </string-name>
          .
          <article-title>A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood</article-title>
          ,
          <source>in Systematic Biology</source>
          , vol
          <volume>52</volume>
          , pages
          <fpage>696</fpage>
          -
          <lpage>704</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>L.</given-names>
            <surname>Haibin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Yushun</surname>
          </string-name>
          ,
          <article-title>CIMFlow: A Workflow Management System Based on Integration Platform Environment</article-title>
          .
          <source>In Proceedings of 7th IEEE International Conference on Emerging Technologies and Factory Automation. Barcelona : ETFA</source>
          ,
          <year>1999</year>
          :
          <fpage>187</fpage>
          -
          <lpage>193</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>M.</given-names>
            <surname>Hallard</surname>
          </string-name>
          &amp; al. Bioside :
          <article-title>faciliter l'acce`es des biologistes aux ressources bioinformatiques</article-title>
          , JOBIM, Montre´eal
          <year>2004</year>
          , p
          <fpage>64</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>D.</given-names>
            <surname>Hull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wolstencroft</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Stevens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. A.</given-names>
            <surname>Goble</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Pocock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Oinn</surname>
          </string-name>
          .
          <article-title>Taverna: a tool for building and running workflows of services</article-title>
          .
          <source>Nucleic Acids Research</source>
          ,
          <volume>34</volume>
          (
          <string-name>
            <surname>Web-Server-Issue</surname>
          </string-name>
          ):
          <fpage>729732</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>T.</given-names>
            <surname>Libourel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Mougenot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pierkot</surname>
          </string-name>
          , JC. Desconnets,
          <string-name>
            <surname>A Platform</surname>
          </string-name>
          <article-title>Dedicated to Share and Mutualize Environmental Applications</article-title>
          .
          <source>Proceedings of 12th International Conference on Enterprise Information Systems</source>
          , Madere,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Libourel</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          <article-title>Mougenot, A Workflow Language for the Experimental Sciences</article-title>
          ,
          <source>Proceedings of 11th International Conference on Enterprise Information Systems</source>
          , Milan,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Object</given-names>
            <surname>Management</surname>
          </string-name>
          <article-title>Group (OMG), OMG Unified Modeling LanguageTM (OMG UML)</article-title>
          ,
          <source>Infrastructure Version 2</source>
          .3. OMG Document Number: formal/2010-05-03.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Object Management Group (OMG),
          <source>SPEM - Software &amp; Systems Process Engineering Meta-Model Specification, Version</source>
          <volume>2</volume>
          .0. OMG Document Number: formal/2008-04-01.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. Object Management Group (OMG),
          <source>Meta Object Facility (MOF) Core Specification OMG Available Specification Version 2</source>
          .0,
          <string-name>
            <given-names>OMG</given-names>
            <surname>Document</surname>
          </string-name>
          Number: formal/06-01-01.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. P. Pinheiro da Silva,
          <string-name>
            <given-names>L.</given-names>
            <surname>Salayandia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.Q.</given-names>
            <surname>Gates</surname>
          </string-name>
          , WDO-It!
          <article-title>A Tool for Building Scientific Workflows from Ontologies (</article-title>
          <year>2007</year>
          ).
          <source>Departmental Technical Reports (CS). Paper</source>
          <volume>201</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>T. D. Schneider</surname>
            and
            <given-names>R. M.</given-names>
          </string-name>
          <string-name>
            <surname>Stephens</surname>
          </string-name>
          , Sequence Logos:
          <article-title>A New Way to Display Consensus Sequences</article-title>
          .
          <source>In Nucleic Acids Res</source>
          ., vol
          <volume>18</volume>
          , pages
          <fpage>6097</fpage>
          -
          <lpage>6100</lpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>G.A.</given-names>
            <surname>Reeves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Eilbeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Magrane</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.O'Donovan</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Montecchi-Palazzi</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>S.E.</given-names>
          </string-name>
          <string-name>
            <surname>Orchard</surname>
            ,
            <given-names>R.C.</given-names>
          </string-name>
          <string-name>
            <surname>Jimenez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Prlic</surname>
            ,
            <given-names>T. J. P.</given-names>
          </string-name>
          <string-name>
            <surname>Hubbard</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Hermjakob</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          <string-name>
            <surname>Thornton</surname>
          </string-name>
          .
          <article-title>The Protein Feature Ontology: a tool for the unification of protein feature annotations</article-title>
          .
          <source>In Bioinformatics</source>
          , vol
          <volume>24</volume>
          , pages
          <fpage>2767</fpage>
          -
          <lpage>2772</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>K.</given-names>
            <surname>Eilbeck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.E</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.J Mungall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Yandell</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Durbin</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ashburner</surname>
          </string-name>
          .
          <article-title>The Sequence Ontology: a tool for the unification of genome annotations</article-title>
          .
          <source>In Genome Biology</source>
          , vol
          <volume>6</volume>
          ,
          <string-name>
            <surname>pages</surname>
            <given-names>R44</given-names>
          </string-name>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>