<!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>UCM at CLEF eHealth 2013 Shared Task1</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Luc a Hervas</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>V ctor Mart nez</string-name>
          <email>victormartinezsimon@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Irene Sanchez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alberto D az</string-name>
          <email>albertodiaz@fdi.ucm.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>NIL Group University Complutense of Madrid C/Profesor Garc a Santesmases</institution>
          ,
          <addr-line>Madrid, 28040</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We are developing a system that analyze medical reports and extract a SNOMED-CT based concept representation. The more interesting characteristic of our system is not only that it can detect the concepts. It also takes into account if they appear in an a rmative, negative or speculative context. The system also separates the concept representation according to the structure of the document. Our system takes these steps: automatic orthographic correction, acronyms and abbreviation detection, negation and speculation phrase detection and medical concepts detection. For participating in Task 1 we have adapted our system in order to obtain the mentions that belong to the Disorders UMLS semantic group. The approach is based on using MetaMap to detect the concepts and the spans. Our aim was to identify what was the best way to use MetaMap in our system to solve the Task 1.</p>
      </abstract>
      <kwd-group>
        <kwd>Natural Language Processing</kwd>
        <kwd>medical report</kwd>
        <kwd>spellcheck</kwd>
        <kwd>acronym expansion</kwd>
        <kwd>negated phrase</kwd>
        <kwd>speculated phrase</kwd>
        <kwd>concept detection</kwd>
        <kwd>Metamap</kwd>
        <kwd>UMLS</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>With the advent of computers and especially the Internet, the information
explosion produced has grown by leaps and bounds.We are in a time where progress
allow us to generate, store and distribute lots of information. But all this
advances have disadvantages too.</p>
      <p>By this moment lots of information are generated, and di erentiate the
correct information from the wrong information requires a big amount of money
and time.</p>
      <p>With the aim of reduce this two problems, the computer engineers, the
software developers and the medicine experts, are developing di erent strategies to
extract information from di erent places and increase the medical knowledge, to
improve researches and in the last term, to have a better live.</p>
      <p>With this aim in mind, we decide to develop a tool to help medical experts
in their job.</p>
      <p>During our research, we discover the CLEF tasks [12] for biomedical
documents which is very close of what we are developing so we decide to participate
to increase our knowing and the performance of our system.</p>
      <p>We develop software to solve the rst task that consist in discover where are
the di erent medical concepts in a medical report and catalogue them, using for
this the UMLS CUIs.</p>
      <p>We are developing a system that analyze medical records and extract a
SNOMED-CT based concept representation. Before the analysis we have other
phases: a language corrector and an acronyms expander. The more interesting
characteristic of our system is that not only detect the concepts, it also take into
account if they appear in an a rmative, negative or speculative context. The
system also separates the concept representation according to the structure of
the document, that is, there is a di erent representation for each section of the
document.</p>
      <p>For participating in Task 1 we have adapted our system in order to obtain
the mentions that belong to the Disorders UMLS semantic group. The approach
is based on using MetaMap to detect the concepts and the spans. Our aim was
to identify what was the best way to use MetaMap in our system to solve the
Task1.</p>
      <p>We have submitted runs with no external annotations, two for task 1a and
two for task 1b. The di erence between the runs is only the DB used. We used
the 2012AA USAbase strict model for the rst run and the 2011AA USAbase
strict model for the second run. Our best results for task 1a show 0.504 F1
score with strict evaluation, and 0.660 F1 score with relaxed evaluation. Our
best results for task 1b show 0.362 Accuracy with strict evaluation and 0.870
Accuracy with relaxed evaluation.
2</p>
    </sec>
    <sec id="sec-2">
      <title>State of the art</title>
      <p>The aim of this part of the text it's explain the di erent tools and approximations
that actually exists in the world of natural language processing and which of
them we use in our project and are used in the software developed for Clef task.</p>
      <p>The di erent tools analyzed were:
{ Ontologies
{ MetaMap
{ Concept detection and disambiguation
{ Orthographic correction
{ Negation detection
{ Speculation detection
2.1</p>
      <sec id="sec-2-1">
        <title>Ontologies</title>
        <p>
          One de nition of what it is an ontology is this: \An ontology de nes the basic
terms and relations comprising the vocabulary of a subject area, as well as the
rules for combining these terms and relations de ne extensions to the
vocabulary"[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>In medical and biomedical reports, there are two important ontologies:
SNOMEDCT and UMLS
{ SNOMED-CT:</p>
        <p>SNOMED-CT or Systematized Nomenclature of Medicine Clinical Terms
is a big ontology of medical concepts, written in di erent idioms and by
this moment it's used in more than fty di erent countries. Since 2007, the
SNOMED-CT license belongs to the International Health Terminology
Standards Development Organization (IHTSDO) which distributed and
maintains the Ontology.</p>
        <p>SNOMED-CT it's compound by this elements:</p>
        <p>Concepts: They represent di erent medical terms. All of them, have a
unique identi er.</p>
        <p>Descriptors: A concept could have more than one di erent descriptor,
which are synonyms between them.</p>
        <p>Relationships: These are use to connect di erent concepts because they
have any kind of relationship.
{ UMLS:</p>
        <p>UMLS or Uni ed Medical Language System is a le and software set which
have a big amount of biomedical terms. It was developed by the National
Library of Medicine (NLM). It's compound by 4 kind of elements.</p>
        <p>Metathesaurus:
It's a big database with lots of biomedical concepts. It takes as sources
some databases, for example: MeSH, RxNorm and SNOMED-CT.
All elements in the Metathesaurus gets an identi cation number to
represent them.</p>
        <p>Semantic type:
The semantic type it's used to classify the biomedical vocabulary and it
also contains the di erent relationships between all the concepts.
Specialized lexicon.</p>
        <p>A specialized lexicon its incorporated into MetaMap distribution, which
have more than 200.000 di erent terms and common English words.
This terms are use to improve the di erent lexical tools included in the
distribution.</p>
        <p>Di erent lexical tools like:</p>
        <p>A Lexical Variant Generator (LVG).</p>
        <p>A word index generator (WordInd).</p>
        <p>A normalized strings generator (Norm)
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>MetaMap</title>
        <p>The MetaMap program has been used extensively for a wide array of BioNLP
studies, such as automatic indexing of biomedical literature and concept based
text summarization.</p>
        <p>MetaMap nds Metathesaurus concepts by performing a shallow syntactic
analysis of the input text, producing a set of noun phrases. The noun phrases
are then used to generate sets of variants which are consequently looked up
from the Metathesaurus concepts. Matching concepts are evaluated against the
original text and the strength of the mappings are calculated. The candidates
are nally combined and the nal scores are computed, where the highest score
of a complete mapping represents MetaMap's interpretation of the text.</p>
        <p>The MetaMap program is provided to be run both locally and remotely. We
ran the current version of MetaMap, MetaMap2012 remotely via the batch mode
facility.</p>
        <p>The parameter set that in uences the performance of MetaMap included;
using a Relaxed model, selecting the NLM2102AB Metathesaurus version,
including all derivational variants, enabling unique acronym/abbreviation variants
only, allowing large N, preferring multiple concepts and using word sense
disambiguation.</p>
        <p>Relaxed Model is a model provided by MetaMap in addition to the Strict
model. MetaMap o ers the Strict model as a default setting in which all types
of lterings are applied, however, we applied the Relaxed model in which only
Manual and Lexical lterings are used. While the Strict model is most
appropriate for experiments that require the highest accuracy, it only covers only 53% of
the Metathesaurus strings. As we consider high coverage of concepts an
important factor, we thus applied the relaxed model which consists of up to 83% of
Metathesaurus strings.</p>
        <p>The versions of Metathesaurus, Base, USAbase and NLM, provided with
MetaMap are di erent in their Metathesaurus coverage and the license type
required for using vocabulary sources. The NLM version which is o ered at no
cost for research purposes and covers all of the provided Metathesaurus was used
in our work.</p>
        <p>Variants, such as in ectional and derivational variants, are computed by
MetaMap to account for the textual variation in the text. With this setting,
many types of variants are generated recursively, and only acronyms and
abbreviations are restricted to the unique ones. In addition, the candidates also include
words that can be prepositions, conjunctions or determiners if they occur often
enough in Metathesaurus.</p>
        <p>Prefer multiple concepts causes MetaMap to score the mappings with more
concepts higher than those with fewer concepts. This option is useful for
discovering higher-order relationships among concepts found in the text and as such
is assumed to be helpful.</p>
        <p>Word sense disambiguation attempts to solve lexical ambiguities by
identifying the correct meaning of a word based on its context. By using this option in
MetaMap, the program attempts to solve the ambiguities among equally scoring
concepts by choosing the concept(s) based on semantic type.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Concept detection and disambiguation.</title>
        <p>When we are detecting a concept, we can't only search any word in the text
into a database, because is high probably that this same concept has more than
one entrance into the database. To do our work, we start searching di erent
ways to detect and disambiguate concept, and we decide to work with MetaMap
software.</p>
        <p>As we have just said, MetaMap, includes concept disambiguation, with a very
good result ratio.</p>
        <p>They use an algorithm written on C++, that after a few time, it was written
into Java and Perl. This algorithm is based in the Hidden Markov Model and
was modify to include contextual and grammatical information to improve the
system accuracy.</p>
        <p>The developers also using a training set, learn which words can go with
another words based on their grammatical category [11].</p>
        <p>With all these improvements, they made an algorithm that with a 1000
different phrases, they have a 97,43% precision with 582 phrases correctly marked
and 261 phrases with only one error.
2.4</p>
      </sec>
      <sec id="sec-2-4">
        <title>Orthographic correction.</title>
        <p>When a doctor it's writing a medical report, he or she may have a misspelling
because he or she is writing very fast and taking notes. A little orthographic
error can change the meaning of all the phrase so good written reports are
recommended.</p>
        <p>We can say that an orthographic corrector it's an algorithm that checks every
word into a database and says if this word is correct or if it's incorrect and in this
case, says some corrections ordered by a score. The best of all these algorithm is
the one who says the better suggestions. To increase the suggestions ratio, they
use some di erent methods like:</p>
        <p>When we talk and write, we don't say every phrases a rmed, we use
negative phrase to emphasize di erent things. On medical reports, negated phrases
are very important to detect, because they say some concepts that the patient
doesn't have and if we misinterpret this phrases and concepts, we will go in the
wrong direction.</p>
        <p>We use 2 approximations to solve this problem. The rst was use the NegEx
algorithm as is distributed, and the second option was use the MetaMap NegEx
algorithm implementation.</p>
        <p>
          NegEx algorithm The NegEx algorithm [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] uses regular expressions to detect
when a phrase is negated and say witch word of all causes this detection.
        </p>
        <p>The algorithm uses as regular expressions, four kind of concepts:
{ Negative words: these are the words that negate all the phrase that appear
right after them.
{ PostNegative words: these are the words that negate the phrase right before
them.
{ Conjunctions: these are the words that connect di erent negative phrases.
{ Pseudo Negations: these are the words that we may think that make a phrase
negative, but the really don't do that, so when we detect this words, we skip
them.</p>
        <p>NegEx on MetaMap MetaMap include the NegEx algorithm, but in the year
2009, the MetaMap developers improve the algorithm1.</p>
        <p>The improvements where this:
{ Add new words to detect negations like: other than, otherwise, to account
for, to explain and then.
{ Add to MetaMap databases, some negated concepts. If any of this concepts
appear in the text, then the phrase is negated.</p>
        <p>{ Join di erent negated concepts into one, to reduce noise.
2.6</p>
      </sec>
      <sec id="sec-2-5">
        <title>Speculation detection.</title>
        <p>The speculation detection it's a very important task in biomedical report.
Sometimes, specialist aren't really sure about what are they detecting, because some
di erent illness have the same symptoms.</p>
        <p>
          To resolve this issue, after a web search, we learn how to adapt the NegEx
algorithm to detect the speculation phrases into a medical report [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
1 http://metamap.nlm.nih.gov/MM09 Release Notes.shtml
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Framework evaluation</title>
      <p>Participants will be provided training and test datasets. The evaluation for all
tasks will be conducted using the withheld test data. Participating teams are
asked to stop development as soon as they download the test data. Teams are
allowed to use any outside resources in their algorithms. However, system output
for systems that use annotations outside of those provided for Tasks 1 will be
evaluated separately from system output generated without additional
annotations.
3.1</p>
      <sec id="sec-3-1">
        <title>Evaluation Measures</title>
        <p>Task 1 - Named entity recognition and normalization of disorders</p>
        <p>A. Boundary detection of disorders: identify the span of all named entities
that could be classi ed by the UMLS semantic group Disorder (excluding the
semantic type Findings)</p>
        <p>Evaluation measure: F1-score
{ F1-score = (2 * Recall * Precision) / (Recall + Precision)
{ Recall = TP / (TP + FN)
{ Precision = TP / (TP + FP)
{ TP = same span
{ FP = spurious span
{ FN = missing span
Exact F1-score: span is identical to the reference standard span
Overlapping F1-score: span overlaps reference standard span</p>
        <p>B. Named entity recognition and normalization of disorders: identify the
boundaries of disorders and map them to a SNOMED-CT code.</p>
        <p>Evaluation measure: Accuracy
{ Accuracy = Correct/Total
{ Correct = Number of disorder named entities with strictly correct span and
correctly generated code
{ Total = Number of disorder named entities, depending on strict or relaxed
setting:</p>
        <p>Strict: Total = Total number of reference standard named entities. In
this case, the system is penalized for incorrect code assignment for
annotations that were not detected by the system.</p>
        <p>Relaxed: Total = Total number of named entities with strictly correct
span generated by the system. In this case, the system is only evaluated
on annotations that were detected by the system.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Processing</title>
      <p>As we have just say, we are developing another system that extract a rmative,
negative and speculative concepts from medical reports and when we decide
participate on Clef tasks, we made a few changes in our software to satisfy the
requisites. Here we will explain what our system does and which changes we
made to adjust to Clef tasks.
4.1</p>
      <sec id="sec-4-1">
        <title>The software tool</title>
        <p>The rst action that is done in our system it's transform the medical report to
a XML le, so we can use it easily. To do this little task, we use di erent and
con gurable regular expressions, where we de ne di erent \Beginning words"
witch means the beginning of any di erent sections in our report. For example,
we have this sections: \Allergies", \Family history". When a \Beginning word" is
detected, we assume that in this moment, a new sections begins and it continues
until the end of the report or another \Beginning Word".</p>
        <p>After that, we made a orthographic correction using the Hunspell's
algorithms and dictionaries. We only made a correction if there is a lot of score in
the suggestion, because if we correct all the things that Hunspell suggest, we'll
probably introduce some noise that in future actions will be very dangerous.</p>
        <p>The next step that we do, it's detect acronyms and abbreviation, using for
that 3 kinds of detectors:
1. A Database that we have developed, witch contains some di erent acronyms
and abbreviation and a few rules to make a little disambiguation.
2. The MetaMap acronym and abbreviation detector.
3. Using MetaMap with an UDA le.</p>
        <p>The next step in our system it's the negation detection. To do this issue rst we
think in the NegEx algorithm but MetaMap includes a modi ed NegEx algorithm
so we use this last option.</p>
        <p>After this last step, we have a speculation detector which works very easily.
We have a NegEx algorithm modi ed to detect some speculative words as regular
expressions.</p>
        <p>Finally, we have the concept detector.</p>
        <p>To do this nally task, we use MetaMap to detect the di erent concepts
and to know their CUI. MetaMap retrieves some concepts, so to reduce the
noise, we only take the concepts with the most score of all of them. We also
use the MedPost/SKR server included in MetaMap to have a disambiguation
between concepts. Another noise reductive technique that we develop, was a
custom dataset of concepts using to create it the MetamorphoSys tool and the
DataFileBuilder developed by the MetaMap group.</p>
        <p>After all this job, we save the results in a XML le to use them in the future
for di erent things, like use Lucene to search between di erent medical reports.
For participating in Task 1 we have adapted our system in order to obtain the
mentions that belong to the UMLS semantic group Disorders. The approach
is based on using MetaMap to detect the concepts and the spans. We have
submitted runs with no external annotations, two for task 1a and two for task
1b. The di erence between the runs is only the DB used. We used the 2012AA
USAbase strict model for the rst run and the 2011AA USAbase strict model for
the second run. Our best results for task 1a shown a 0.504 F1 score with strict
evaluation, and a 0.660 F1 score with relaxed evaluation. In strict evaluation 18th
and 20th of 27 runs. In relaxed evaluation, 21th and 22th of 28 runs. Explain
the di erences between strict and relaxed evaluation. Explain the di erences
between using 2012AA or 2011AA.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Errors and Analysis</title>
      <p>With respect to Task 1a, our system have a lot of false positive, because the
only word sense disambiguation that we use, it's with the MedPost/SKR server
included in MetaMap distribution, and better with the databases of 2011.</p>
      <p>With respect to Task 1b, we have a very good ratio detection of CUIs.
MetaMap returns a lot of possible candidates, but we decide to save only the one
with bigger score and in case of there are more than one with the same score,
the rst to appear in the list. We fail in this task for two reasons:
1. We don't take a look on the other results that MetaMap retrieve, so maybe
the good one it's the second with most score.
2. We have the same error than in task 1a, we don't have a good word sense
disambiguation, so we have lots of false positive detections.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>We want to acknowledge the support given by the Shared Annotated Resources
(ShARe) project, funded by the United States National Institutes of Health with
grant number R01GM090187.
11. Smith, L., Rind esch, T., and Wilbur, W. J.: MedPost: a part of speech tagger for
biomedical text. Bioinformatics, (2004)
12. Suominen, H., Salantera, S., Velupillai, S.: Three Shared Tasks on Clinical Natural</p>
      <p>Language Processing. Proceedings of CLEF 2013. To appear
13. Taft, R. L.: Name search techniques. Bureau of Systems Development, New York
State Identi cation and Intelligence System, (1970), no. 1</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Chapman</surname>
            ,
            <given-names>W. W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bridewell</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hanbury</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>G. F.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Buchanan</surname>
            ,
            <given-names>B. G.</given-names>
          </string-name>
          :
          <article-title>A simple algorithm for identifying negated ndings and diseases in discharge summaries</article-title>
          .
          <source>Journal of biomedical informatics</source>
          , vol.
          <volume>34</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>301</fpage>
          -
          <lpage>310</lpage>
          , (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Damerau</surname>
            ,
            <given-names>F. J.:</given-names>
          </string-name>
          <article-title>A technique for computer detection and correction of spelling errors</article-title>
          .
          <source>Communications of the ACM</source>
          , vol.
          <volume>7</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>171</fpage>
          -
          <lpage>176</lpage>
          , (
          <year>1964</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Farkas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vincze</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mra</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Csirik</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Szarvas</surname>
          </string-name>
          , G.:
          <article-title>The CoNLL-2010 shared task: learning to detect hedges and their scope in natural language text</article-title>
          .
          <source>in Proceedings of the Fourteenth Conference on Computational Natural Language LearningShared Task. Association for Computational Linguistics</source>
          , (
          <year>2010</year>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hamming</surname>
          </string-name>
          , R. W.:
          <article-title>Error detecting and error correcting codes</article-title>
          .
          <source>Bell System technical journal</source>
          , vol.
          <volume>29</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>147</fpage>
          -
          <lpage>160</lpage>
          , (
          <year>1950</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Krause</surname>
            ,
            <given-names>E. F.</given-names>
          </string-name>
          :
          <article-title>Taxicab geometry: An adventure in non-Euclidean geometry</article-title>
          .
          <source>Courier Dover Publications</source>
          , (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Levenshtein</surname>
            ,
            <given-names>V. I.</given-names>
          </string-name>
          :
          <article-title>Binary codes capable of correcting deletions, insertions and reversals</article-title>
          .
          <source>in Soviet physics doklady</source>
          , vol.
          <volume>10</volume>
          , (
          <year>1966</year>
          ), p.
          <fpage>707</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Neches</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fikes</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gruber</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patil</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Senator</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Swartout</surname>
          </string-name>
          , W.:
          <article-title>Enabling technology for knowledge sharing</article-title>
          .
          <source>AI magazine</source>
          , vol.
          <volume>12</volume>
          , no.
          <issue>3</issue>
          , p.
          <fpage>36</fpage>
          , (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Needleman</surname>
            ,
            <given-names>S. B.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Wunsch</surname>
          </string-name>
          ,
          <string-name>
            <surname>C. D.</surname>
          </string-name>
          :
          <article-title>A general method applicable to the search for similarities in the amino acid sequence of two proteins</article-title>
          .
          <source>Journal of molecular biology</source>
          , vol.
          <volume>48</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>443</fpage>
          -
          <lpage>453</lpage>
          , (
          <year>1970</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Philips</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Hanging on the metaphone</article-title>
          .
          <source>Computer Language</source>
          , vol.
          <volume>7</volume>
          , no.
          <issue>12</issue>
          (
          <issue>December</issue>
          ), (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Odell</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Soundex.
          <source>US Patent</source>
          , vol.
          <volume>1</volume>
          , (
          <year>1918</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>