<?xml version="1.0" encoding="iso-8859-1" standalone="no"?>

<GmsArticle>
  <MetaData>
    <Identifier>mibe000092</Identifier>
    <IdentifierDoi>10.3205/mibe000092</IdentifierDoi>
    <IdentifierUrn>urn:nbn:de:0183-mibe0000927</IdentifierUrn>
    <ArticleType>Original Article</ArticleType>
    <TitleGroup>
      <Title language="en">A SAS&#47;IML algorithm for an exact permutation test</Title>
      <TitleTranslated language="de">Ein SAS&#47;IML-Algorithmus f&#252;r einen exakten Permutationstest</TitleTranslated>
    </TitleGroup>
    <CreatorList>
      <Creator>
        <PersonNames>
          <Lastname>Neuh&#228;user</Lastname>
          <LastnameHeading>Neuh&#228;user</LastnameHeading>
          <Firstname>Markus</Firstname>
          <Initials>M</Initials>
        </PersonNames>
        <Address>Department of Mathematics and Technique, RheinAhrCampus, Koblenz University of Applied Sciences, S&#252;dallee 2, 53424 Remagen, Germany<Affiliation>Department of Mathematics and Technique, RheinAhrCampus, Koblenz University of Applied Sciences, Remagen, Germany</Affiliation></Address>
        <Email>neuhaeuser&#64;rheinahrcampus.de</Email>
        <Creatorrole corresponding="yes" presenting="no">author</Creatorrole>
      </Creator>
      <Creator>
        <PersonNames>
          <Lastname>Schulz</Lastname>
          <LastnameHeading>Schulz</LastnameHeading>
          <Firstname>Andreas</Firstname>
          <Initials>A</Initials>
        </PersonNames>
        <Address>Department of Mathematics and Technique, RheinAhrCampus, Koblenz University of Applied Sciences, S&#252;dallee 2, 53424 Remagen, Germany<Affiliation>Department of Mathematics and Technique, RheinAhrCampus, Koblenz University of Applied Sciences, Remagen, Germany</Affiliation></Address>
        <Creatorrole corresponding="no" presenting="no">author</Creatorrole>
      </Creator>
      <Creator>
        <PersonNames>
          <Lastname>Czech</Lastname>
          <LastnameHeading>Czech</LastnameHeading>
          <Firstname>Daniel</Firstname>
          <Initials>D</Initials>
        </PersonNames>
        <Address>Department of Mathematics and Technique, RheinAhrCampus, Koblenz University of Applied Sciences, S&#252;dallee 2, 53424 Remagen, Germany<Affiliation>Department of Mathematics and Technique, RheinAhrCampus, Koblenz University of Applied Sciences, Remagen, Germany</Affiliation></Address>
        <Creatorrole corresponding="no" presenting="no">author</Creatorrole>
      </Creator>
    </CreatorList>
    <PublisherList>
      <Publisher>
        <Corporation>
          <Corporatename>German Medical Science GMS Publishing House</Corporatename>
        </Corporation>
        <Address>D&#252;sseldorf</Address>
      </Publisher>
    </PublisherList>
    <SubjectGroup>
      <SubjectheadingDDB>610</SubjectheadingDDB>
    </SubjectGroup>
    <DatePublishedList>
      <DatePublished>20090316</DatePublished>
    </DatePublishedList>
    <Language>engl</Language>
    <SourceGroup>
      <Journal>
        <ISSN>1860-9171</ISSN>
        <Volume>5</Volume>
        <Issue>2</Issue>
        <JournalTitle>GMS Medizinische Informatik, Biometrie und Epidemiologie</JournalTitle>
        <JournalTitleAbbr>GMS Med Inform Biom Epidemiol</JournalTitleAbbr>
      </Journal>
    </SourceGroup>
    <ArticleNo>13</ArticleNo>
  </MetaData>
  <OrigData>
    <Abstract language="de" linked="yes">
      <Pgraph>Ein in SAS&#47;IML geschriebener Algorithmus wird pr&#228;sentiert, mit dem ein exakter Permutationstest f&#252;r das Zweistichproben-Problem durchgef&#252;hrt werden kann. Dabei werden alle m&#246;glichen Permutationen ber&#252;cksichtigt. Exemplarisch wird die Baumgartner-Wei&#223;-Schindler-Statistik als Teststatistik f&#252;r den Permutationstest genutzt.</Pgraph>
    </Abstract>
    <Abstract language="en" linked="yes">
      <Pgraph>An algorithm written in SAS&#47;IML is presented that can perform an exact permutation test for a two-sample comparison. All possible permutations are considered. The Baumgartner-Wei&#223;-Schindler statistic is exemplarily used as the test statistic for the permutation test.</Pgraph>
    </Abstract>
    <TextBlock linked="yes" name="Introduction">
      <MainHeadline>Introduction</MainHeadline>
      <Pgraph>For many nonparametric test statistics there are two alternative ways to carry out the test. One possibility is to use the asymptotic distribution of the statistic. For instance, the Wilcoxon rank-sum statistic asymptotically follows a normal distribution (under the null hypothesis). Alternatively, the exact permutation null distribution can be used. In order to perform an exact permutation test, all possible permutations have to be generated, so that the test statistic can be calculated for each permutation. The p-value is the probability of the permutations giving a value of the test statistic as or more supportive of the alternative than the observed value. </Pgraph>
      <Pgraph>In the population model (<TextLink reference="1"></TextLink>, p. 56) the inference is referred to a defined population that has been randomly sampled. Using this classical model-based inference, the asymptotic distribution can be used if the sample sizes were not too small. The randomization model of inference does not require that populations have been randomly sampled. However, the experimental units should be randomized to the groups or treatments (<TextLink reference="1"></TextLink>, p. 5; see also <TextLink reference="2"></TextLink>). In this design-based framework, the p-value should be that from the permutation distribution (see also <TextLink reference="3"></TextLink>). </Pgraph>
      <Pgraph>Ludbrook and Dudley <TextLink reference="4"></TextLink> surveyed prospective, comparative studies reported in several biomedical journals. They found that randomization rather than random sampling is the norm in biomedical research. Very few studies used random sampling of defined populations to construct experimental groups. Furthermore, sample sizes were often small. This suggests that exact permutation tests are useful for many biomedical studies. This is also true for some other areas, e.g. psychology <TextLink reference="5"></TextLink>. </Pgraph>
      <Pgraph>As mentioned above, all possible permutations under the null hypothesis have to be generated in order to perform an exact permutation test. For some commonly used tests such as Wilcoxon&#8217;s rank-sum test the exact permutation test is implemented in software packages. In SAS, for example, the Wilcoxon permutation test can be applied using the procedure NPAR1WAY. However, permutation tests with several other, especially newer statistics are not implemented in procedures. To apply these tests, one has to generate the permutations. </Pgraph>
      <Pgraph>Some programs were recommended in the past, the shuffle algorithm of Chen and Dunlap (<TextLink reference="6"></TextLink>, p. 409) is one example. This algorithm considers a random sample of permutations only. Note that it is useful to use a simple random sample of all possible permutations if the sample sizes were large because, in that case, the number of permutations can be enormous (<TextLink reference="7"></TextLink>, p. 185). However, when sample sizes are small, an exact permutation test can be performed based on all possible permutations.</Pgraph>
      <Pgraph>Here, we propose a SAS&#47;IML program that considers all possible permutations for a two-sample comparison. This program performs an exact permutation test, the Baumgartner-Wei&#223;-Schindler statistics <TextLink reference="8"></TextLink> is exemplarily used as the test statistic for the permutation test. The exact permutation test based on the Baumgartner-Wei&#223;-Schindler statistic was proposed by Neuh&#228;user <TextLink reference="9"></TextLink>. The proposed algorithm is very fast for sample sizes up to 10 per group. For larger samples one may use the shuffle algorithm mentioned above.</Pgraph>
      <Pgraph>Our algorithm combines depth-first search and backtracking <TextLink reference="10"></TextLink>. Depth-first search is an algorithm for searching a tree. At each node, it is checked whether or not progress to a valid solution is possible. If not, or if a goal node is found, the search backtracks, i.e. it returns to the most recent node that was not finished.</Pgraph>
      <Pgraph>Note that a few parts of the original Baumgartner-Wei&#223;-Schindler statistic are identical for every permutation. These parts are redundant for a permutation test and were omitted in the code given below.</Pgraph>
      <Pgraph>The Baumgartner-Wei&#223;-Schindler test was proposed as an omnibus test <TextLink reference="8"></TextLink>. However, permutation tests are also useful in a location-shift model, and also in case of potential differences in variability <TextLink reference="11"></TextLink>. In these cases, it is useful to compute a confidence interval for the location shift in addition to the p-value. A possible way to obtain a confidence interval was proposed by Bauer (<TextLink reference="12"></TextLink>, see also <TextLink reference="13"></TextLink>).</Pgraph>
    </TextBlock>
    <TextBlock linked="yes" name="Program">
      <MainHeadline>Program</MainHeadline>
      <Pgraph>The following SAS macro includes the exact permutation test: </Pgraph>
      <Pgraph>&#37;MACRO Permtest(indata);<LineBreak></LineBreak>proc iml;</Pgraph>
      <Pgraph>&#47;&#42; Reading the data &#42;&#47;<LineBreak></LineBreak>USE &#38;indata;<LineBreak></LineBreak>READ ALL INTO currdata;<LineBreak></LineBreak><LineBreak></LineBreak>&#47;&#42; Computation of ranks &#42;&#47;<LineBreak></LineBreak>ranks&#61;RANKTIE(currdata&#91; ,2&#93;);<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#47;&#42; Calculation of the sample sizes per group &#42;&#47;<LineBreak></LineBreak>N&#95;total&#61;Nrow(currdata&#91; ,2&#93;);<LineBreak></LineBreak>n2&#61;currdata&#91;&#43;,1&#93;;<LineBreak></LineBreak>n1&#61;N&#95;total-n2;<LineBreak></LineBreak>print N&#95;total n1 n2;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#47;&#42; Creation of all possible permutations &#42;&#47;<LineBreak></LineBreak>start perm(n,n&#95;1);</Pgraph>
      <Pgraph>
        <Indentation>matrix &#61; shape(0,(gamma(n&#43;1)&#47;(gamma(n&#95;1&#43;1)&#42;gamma(n-n&#95;1&#43;1))),n);<LineBreak></LineBreak>index &#61; 1;<LineBreak></LineBreak>vektor&#61;shape(-1,1,n);<LineBreak></LineBreak>pos &#61; 1;<LineBreak></LineBreak>ok &#61; 1;<LineBreak></LineBreak>do while(ok&#61;1);</Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>
          <Indentation>if pos &#62; n then do;<LineBreak></LineBreak><LineBreak></LineBreak></Indentation>
        </Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>
          <Indentation>if vektor&#91;,&#43;&#93; &#61; n&#95;1 then do;</Indentation>
        </Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>
          <Indentation>
            <Indentation>matrix&#91;index,&#93;&#61; vektor;<LineBreak></LineBreak>index &#61; index &#43; 1;</Indentation>
          </Indentation>
        </Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>
          <Indentation>end;<LineBreak></LineBreak><LineBreak></LineBreak></Indentation>
        </Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>pos &#61; pos-1;</Indentation>
      </Pgraph>
      <Pgraph>end;</Pgraph>
      <Pgraph>else do;</Pgraph>
      <Pgraph>
        <Indentation>if vektor&#91;,pos&#93; &#60; 1 then do;</Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>
          <Indentation>vektor&#91;,pos&#93; &#61; vektor&#91;,pos&#93;&#43;1;<LineBreak></LineBreak>pos &#61; pos&#43;1;</Indentation>
        </Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>end;<LineBreak></LineBreak><LineBreak></LineBreak></Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>else do;</Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>
          <Indentation>vektor&#91;,pos&#93;&#61;-1;<LineBreak></LineBreak>pos &#61; pos-1;</Indentation>
        </Indentation>
      </Pgraph>
      <Pgraph>
        <Indentation>end;</Indentation>
      </Pgraph>
      <Pgraph>end;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>if pos &#60; 1 then ok &#61; 0;<LineBreak></LineBreak>end;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>return (matrix);<LineBreak></LineBreak>finish;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>permutations &#61; perm(N&#95;total,n1); <LineBreak></LineBreak>P&#61;Nrow(permutations);<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#47;&#42; Calculation of test statistic &#42;&#47;<LineBreak></LineBreak>start test&#95;sta(R1, R2, N&#95;total, n1, n2);<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>b&#61;R1;<LineBreak></LineBreak>R1&#91;,rank(R1)&#93;&#61;b;<LineBreak></LineBreak>b&#61;R2;<LineBreak></LineBreak>R2&#91;,rank(R2)&#93;&#61;b;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>i&#61;1:n1;<LineBreak></LineBreak>j&#61;1:n2;<LineBreak></LineBreak>Bx&#61;sum( (R1-(N&#95;total&#47;n1)&#35;i)&#35;&#35;2&#47;( (i&#47;(n1&#43;1))&#35;(1-(i&#47;(n1&#43;1)))&#35;n2 ) );<LineBreak></LineBreak>By&#61;sum( (R2-(N&#95;total&#47;n2)&#35;j)&#35;&#35;2&#47;( (j&#47;(n2&#43;1))&#35;(1-(j&#47;(n2&#43;1)))&#35;n1 ) );<LineBreak></LineBreak>B&#61;Bx&#43;By;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>return (B);<LineBreak></LineBreak>finish; <LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#47;&#42; Carrying out the test &#42;&#47;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>Tab&#61;REPEAT(T(ranks),P,1); <LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>R1&#61;choose(permutations&#61;0,.,Tab);<LineBreak></LineBreak>R2&#61;choose(permutations&#61;1,.,Tab);<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>R1g&#61;R1&#91;loc(R1&#94;&#61;.)&#93;;<LineBreak></LineBreak>R2g&#61;R2&#91;loc(R2&#94;&#61;.)&#93;;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>R1z&#61;shape(R1g,P, n1);<LineBreak></LineBreak>R2z&#61;shape(R2g,P, n2);<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>test&#95;st0&#61;</Pgraph>
      <Pgraph>
        <Indentation>test&#95;sta(T(ranks&#91;1:n1&#93;),T(ranks&#91;(n1&#43;1):N&#95;total&#93;), N&#95;total, n1, n2);</Indentation>
      </Pgraph>
      <Pgraph>Pval&#61;0;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>do i&#61;1 to P by 1;<LineBreak></LineBreak>B &#61; test&#95;sta(R1z&#91; i , &#93;, R2z&#91; i , &#93;, N&#95;total, n1, n2); <LineBreak></LineBreak>if B &#62;&#61; test&#95;st0 then Pval&#61;Pval&#43;1;<LineBreak></LineBreak>end;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>Pval&#61;Pval&#47;P;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#47;&#42; Definition of output &#42;&#47;<LineBreak></LineBreak>x&#61;(Pval &#124;&#124; test&#95;st0 &#124;&#124; P);<LineBreak></LineBreak>cols&#61;&#123;P&#95;value test&#95;statistic total&#95;Perms&#125;;<LineBreak></LineBreak>print x&#91;colname&#61;cols&#93;;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#47;&#42; optional: Creation of an output dataset called results &#42;&#47;<LineBreak></LineBreak>CREATE results FROM x&#91;colname&#61;cols&#93;;<LineBreak></LineBreak>APPEND FROM x;<LineBreak></LineBreak>CLOSE results; <LineBreak></LineBreak>&#47;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#42;&#47;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>quit;<LineBreak></LineBreak>&#37;MEND Permtest;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>In order to use this macro the SAS dataset needs the variables GROUP and VALUE (in this order). The variable GROUP should have the values 0 and 1 as codes for the two groups. Thus, the data step is as follows:<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>DATA example1;<LineBreak></LineBreak></Pgraph>
      <Pgraph>
        <Indentation>INPUT group value &#64;&#64;;<LineBreak></LineBreak></Indentation>
      </Pgraph>
      <Pgraph>CARDS;<LineBreak></LineBreak>0 154 0 155 0 158 0 159 0 161 0 163 0 177 0 183 0 192 0 219<LineBreak></LineBreak>1 171 1 172 1 178 1 179 1 184 1 185 1 186 1 194 1 196 1 223<LineBreak></LineBreak>;<LineBreak></LineBreak>RUN;<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>Here we use a placebo-controlled trial as an example. The raw data in the data step given above are reaction times (in msec) and were presented by Sedlmeier and Renkewitz (<TextLink reference="14"></TextLink>, p. 583&#93;. The placebo group is coded as 0, the active group as 1. In this example there are no ties. However, our program also works in the presence of ties.</Pgraph>
      <Pgraph>The macro can be invoked with the following statement:<LineBreak></LineBreak><LineBreak></LineBreak></Pgraph>
      <Pgraph>&#37;Permtest(example1);</Pgraph>
    </TextBlock>
    <TextBlock linked="yes" name="Output">
      <MainHeadline>Output</MainHeadline>
      <Pgraph>The first part of the output lists (Figure 1 <ImgLink imgNo="1" imgType="figure"/>) the total sample size N&#95;TOTAL as well as the groups&#8217; sample sizes N1 and N2. In the second part the p-value, the value of the test statistic for the observed data and the number of permutations (TOTAL&#95;PERMS) are given.</Pgraph>
    </TextBlock>
    <TextBlock linked="yes" name="Notes">
      <MainHeadline>Notes</MainHeadline>
      <SubHeadline>Acknowledgement</SubHeadline>
      <Pgraph>The first author gratefully acknowledges support of this work by the Ministry for Education, Science, Youth and Culture of Rhineland-Palatinate for a Competence Center in Biomathematics.</Pgraph>
      <SubHeadline>Conflict of interest</SubHeadline>
      <Pgraph>None declared.</Pgraph>
    </TextBlock>
    <References linked="yes">
      <Reference refNo="1">
        <RefAuthor>Lehmann EL</RefAuthor>
        <RefTitle></RefTitle>
        <RefYear>1975</RefYear>
        <RefBookTitle>Nonparametrics: Statistical methods based on ranks</RefBookTitle>
        <RefPage></RefPage>
        <RefTotal>Lehmann EL. Nonparametrics: Statistical methods based on ranks. San Francisco, CA: Holden-Day; 1975. DOI: 10.1002&#47;zamm.19770570922</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.1002&#47;zamm.19770570922</RefLink>
      </Reference>
      <Reference refNo="2">
        <RefAuthor>Ludbrook J</RefAuthor>
        <RefAuthor>Dudley H</RefAuthor>
        <RefTitle>Issues in biomedical statistics: statistical inference</RefTitle>
        <RefYear>1994</RefYear>
        <RefJournal>Aust N Z J Surg</RefJournal>
        <RefPage>630-6</RefPage>
        <RefTotal>Ludbrook J, Dudley H. Issues in biomedical statistics: statistical inference. Aust N Z J Surg. 1994;64:630-6. DOI: 10.1111&#47;j.1445-2197.1994.tb02308.x</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.1111&#47;j.1445-2197.1994.tb02308.x</RefLink>
      </Reference>
      <Reference refNo="3">
        <RefAuthor>Neuh&#228;user M</RefAuthor>
        <RefTitle>Exact tests based on the Baumgartner-Wei&#223;-Schindler statistic - a survey</RefTitle>
        <RefYear>2005</RefYear>
        <RefJournal>Stat Papers</RefJournal>
        <RefPage>1-30</RefPage>
        <RefTotal>Neuh&#228;user M. Exact tests based on the Baumgartner-Wei&#223;-Schindler statistic - a survey. Stat Papers. 2005;46:1-30. DOI: 10.1007&#47;BF02762032</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.1007&#47;BF02762032</RefLink>
      </Reference>
      <Reference refNo="4">
        <RefAuthor>Ludbrook J</RefAuthor>
        <RefAuthor>Dudley H</RefAuthor>
        <RefTitle>Why permutation tests are superior to t and F tests in biomedical research</RefTitle>
        <RefYear>1998</RefYear>
        <RefJournal>Am Stat</RefJournal>
        <RefPage>127-32</RefPage>
        <RefTotal>Ludbrook J, Dudley H. Why permutation tests are superior to t and F tests in biomedical research. Am Stat. 1998;52:127-32. DOI: 10.2307&#47;2685470</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.2307&#47;2685470</RefLink>
      </Reference>
      <Reference refNo="5">
        <RefAuthor>Hunter MA</RefAuthor>
        <RefAuthor>May RB</RefAuthor>
        <RefTitle>Some myths concerning parametric and nonparametric tests</RefTitle>
        <RefYear>1993</RefYear>
        <RefJournal>Can Psychol</RefJournal>
        <RefPage>384-9</RefPage>
        <RefTotal>Hunter MA, May RB. Some myths concerning parametric and nonparametric tests. Can Psychol. 1993;34(4):384-9. DOI: 10.1037&#47;h0078860</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.1037&#47;h0078860</RefLink>
      </Reference>
      <Reference refNo="6">
        <RefAuthor>Chen RS</RefAuthor>
        <RefAuthor>Dunlap WP</RefAuthor>
        <RefTitle>SAS procedures for approximate randomization tests</RefTitle>
        <RefYear>1993</RefYear>
        <RefJournal>Behav Res Methods Instrum Comput</RefJournal>
        <RefPage>406-9</RefPage>
        <RefTotal>Chen RS, Dunlap WP. SAS procedures for approximate randomization tests. Behav Res Methods Instrum Comput. 1993;25:406-9.</RefTotal>
      </Reference>
      <Reference refNo="7">
        <RefAuthor>Good PI</RefAuthor>
        <RefTitle></RefTitle>
        <RefYear>2000</RefYear>
        <RefBookTitle>Permutation tests</RefBookTitle>
        <RefPage></RefPage>
        <RefTotal>Good PI. Permutation tests. 2nd ed. New York: Springer; 2000.</RefTotal>
      </Reference>
      <Reference refNo="8">
        <RefAuthor>Baumgartner W</RefAuthor>
        <RefAuthor>Wei&#223; P</RefAuthor>
        <RefAuthor>Schindler H</RefAuthor>
        <RefTitle>A nonparametric test for the general two-sample problem</RefTitle>
        <RefYear>1998</RefYear>
        <RefJournal>Biometrics</RefJournal>
        <RefPage>1129-35</RefPage>
        <RefTotal>Baumgartner W, Wei&#223; P, Schindler H. A nonparametric test for the general two-sample problem. Biometrics. 1998;54:1129-35. DOI: 10.2307&#47;2533862</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.2307&#47;2533862</RefLink>
      </Reference>
      <Reference refNo="9">
        <RefAuthor>Neuh&#228;user M</RefAuthor>
        <RefTitle>An exact two-sample test based on the Baumgartner-Wei&#223;-Schindler statistic and a modification of Lepage&#39;s test</RefTitle>
        <RefYear>2000</RefYear>
        <RefJournal>Communications in Statistics - Theory and Methods</RefJournal>
        <RefPage>67-78</RefPage>
        <RefTotal>Neuh&#228;user M. An exact two-sample test based on the Baumgartner-Wei&#223;-Schindler statistic and a modification of Lepage&#39;s test. Communications in Statistics - Theory and Methods. 2000;29(1):67-78. DOI: 10.1080&#47;03610920008832469</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.1080&#47;03610920008832469</RefLink>
      </Reference>
      <Reference refNo="10">
        <RefAuthor>Bothner PP</RefAuthor>
        <RefAuthor>K&#228;hler WM</RefAuthor>
        <RefTitle></RefTitle>
        <RefYear>1991</RefYear>
        <RefBookTitle>Programmieren in PROLOG: eine umfassende und praxisorientierte Einf&#252;hrung</RefBookTitle>
        <RefPage></RefPage>
        <RefTotal>Bothner PP, K&#228;hler WM. Programmieren in PROLOG: eine umfassende und praxisorientierte Einf&#252;hrung. Braunschweig: Vieweg; 1991</RefTotal>
      </Reference>
      <Reference refNo="11">
        <RefAuthor>Neubert K</RefAuthor>
        <RefAuthor>Brunner E</RefAuthor>
        <RefTitle>A studentized permutation test for the non-parametric Behrens-Fisher problem</RefTitle>
        <RefYear>2007</RefYear>
        <RefJournal>Comput Stat Data Anal</RefJournal>
        <RefPage>5192-204</RefPage>
        <RefTotal>Neubert K, Brunner E. A studentized permutation test for the non-parametric Behrens-Fisher problem. Comput Stat Data Anal. 2007;51(10):5192-204. DOI: 10.1016&#47;j.csda.2006.05.024</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.1016&#47;j.csda.2006.05.024</RefLink>
      </Reference>
      <Reference refNo="12">
        <RefAuthor>Bauer DF</RefAuthor>
        <RefTitle>Constructing confidence sets using rank statistics</RefTitle>
        <RefYear>1972</RefYear>
        <RefJournal>J Am Stat Assoc</RefJournal>
        <RefPage>687-90</RefPage>
        <RefTotal>Bauer DF. Constructing confidence sets using rank statistics. J Am Stat Assoc. 1972;67(339):687-90. DOI: 10.2307&#47;2284469</RefTotal>
        <RefLink>http:&#47;&#47;dx.doi.org&#47;10.2307&#47;2284469</RefLink>
      </Reference>
      <Reference refNo="13">
        <RefAuthor>Neubert K</RefAuthor>
        <RefTitle></RefTitle>
        <RefYear>2006</RefYear>
        <RefBookTitle>Das nichtparametrische Behrens-Fisher-Problem: ein studentisierter Permutationstest und robuste Konfidenzintervalle f&#252;r den Shift-Effekt</RefBookTitle>
        <RefPage></RefPage>
        <RefTotal>Neubert K. Das nichtparametrische Behrens-Fisher-Problem: ein studentisierter Permutationstest und robuste Konfidenzintervalle f&#252;r den Shift-Effekt &#91;PhD thesis&#93;. G&#246;ttingen: University; 2006.</RefTotal>
      </Reference>
      <Reference refNo="14">
        <RefAuthor>Sedlmeier P</RefAuthor>
        <RefAuthor>Renkewitz F</RefAuthor>
        <RefTitle></RefTitle>
        <RefYear>2008</RefYear>
        <RefBookTitle>Forschungsmethoden und Statistik in der Psychologie</RefBookTitle>
        <RefPage></RefPage>
        <RefTotal>Sedlmeier P, Renkewitz F. Forschungsmethoden und Statistik in der Psychologie. M&#252;nchen: Pearson Studium; 2008</RefTotal>
      </Reference>
    </References>
    <Media>
      <Tables>
        <NoOfTables>0</NoOfTables>
      </Tables>
      <Figures>
        <Figure format="png" height="155" width="343">
          <MediaNo>1</MediaNo>
          <MediaID>1</MediaID>
          <Caption>
            <Pgraph>
              <Mark1>Figure 1: Output lists</Mark1>
            </Pgraph>
          </Caption>
        </Figure>
        <NoOfPictures>1</NoOfPictures>
      </Figures>
      <InlineFigures>
        <NoOfPictures>0</NoOfPictures>
      </InlineFigures>
      <Attachments>
        <NoOfAttachments>0</NoOfAttachments>
      </Attachments>
    </Media>
  </OrigData>
</GmsArticle>
