Open Access

A genome alignment algorithm based on compression

BMC Bioinformatics201011:599

Received: 8 February 2010

Accepted: 16 December 2010

Published: 16 December 2010



Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of the two sequences. They are often computationally expensive and unable to deal with low information regions. Furthermore, they lack a well-principled objective function to measure the performance of sets of parameters. Since genomic sequences carry genetic information, this article proposes that the information content of each nucleotide in a position should be considered in sequence alignment. An information-theoretic approach for pairwise genome local alignment, namely XMAligner, is presented. Instead of comparing sequences at the character level, XMAligner considers a pair of nucleotides from two sequences to be related if their mutual information in context is significant. The information content of nucleotides in sequences is measured by a lossless compression technique.


Experiments on both simulated data and real data show that XMAligner is superior to conventional methods especially on distantly related sequences and statistically biased data. XMAligner can align sequences of eukaryote genome size with only a modest hardware requirement. Importantly, the method has an objective function which can obviate the need to choose parameter values for high quality alignment. The alignment results from XMAligner can be integrated into a visualisation tool for viewing purpose.


The information-theoretic approach for sequence alignment is shown to overcome the mentioned problems of conventional character matching alignment methods. The article shows that, as genomic sequences are meant to carry information, considering the information content of nucleotides is helpful for genomic sequence alignment.


Downloadable binaries, documentation and data can be found at


Advances in sequencing technology allow high throughput production of biological sequences in sequencing laboratories around the world. The exponential increase of genomic data extracted recently introduces the need for analysis techniques that can handle the large amount of data. This is very challenging as conventional analysis methods can be overwhelmed by volume and misled by statistical biases. It is important to develop novel tools that are time efficient and able to cope with the diversity of the data.

One of the most important tools for sequence analysis, if not the most important one, is sequence alignment which attempts to arrange biological sequences to identify regions of similarity. Similarities between sequences can provide clues to discover the evolutionary relationship between species, to annotate new sequences and to compare an un-known sequence against existing sequences in a large database. There are two broad kinds of sequence alignment, namely global alignment and local alignment. Global alignment attempts to match entire sequences from end to end and thus is suitable for comparing short sequences that are expected to have similar structures and functions such as proteins or genes. On the other hand, local alignment searches for conserved regions, possibly reordered, between two sequences. Local alignment is thus more suitable for analysing long sequences, such as chromosomes or genomes, especially from distantly related species where significant insertions, deletions and large rearrangements may have occurred.

Most existing alignment methods are inspired by the dynamic programming approach [1, 2] which attempts to examine all possible pairings of the two sequences and chooses the highest matching score alignment. This dynamic programming alignment approach has quadratic time and space complexities and hence is unattractive for handling long sequences and high volume sequence databases. To trade sensitivity for running time, heuristic search methods are often used. Instead of comparing every single base of the two sequences, FASTA [3] and BLAST [4], the two most popular database search tools, first search for seeds of k consecutive exact matches. Seeds are then extended, by limited dynamic programming, to allow for mutations and gaps.

Since 1995 when the first genome of a free-living organism was sequenced [5], a number of alignment tools capable of comparing genomes have been developed. Such examples are Gapped BLAST [6], Sim4 [7], SSAHA [8], Dialign [9], MGA [10], MUM-mer [11, 12], Blastz [13], Chaos [14], and AVID [15]. Most of these methods rely on the ideas of FASTA and BLAST; they use different techniques for finding seeds and for extending seeds to identify conserved regions. Often, seeds are located by an indexing method such as hash tables (allowing or not allowing gaps), suffix trees or suffix arrays. Seeds are then extended in a fashion similar to the dynamic programming approach to form larger similar regions. Many tools chain together sufficiently near seeds, and report statistically significant chains as homologues. A comprehensive review of genome wide alignment tools is presented in [16].

Most traditional alignment methods rely heavily on a scoring scheme that includes a substitution matrix, which describes the mutation rates between nucleotides or amino acids, and other parameters such as gap penalties. However, these methods lack a well-principled objective function to measure the performance of a set of parameters: "There is considerable disagreement among biologists about the 'right' choice of parameters" [17]. Using a generic substitution matrix may be suitable for protein alignment as the rates of substitution in protein largely depend on the similarities between amino acid properties which are well understood. However, this is not the case in nucleotides; more than one codon can code for an amino acid and different strains show different codon preferences for a given amino acid [18]. It is therefore sometimes very hard to find a suitable scoring scheme for alignment of genomes, especially when little is known about the sequences. The selection of a scoring scheme would be managed easily with a reasonable objective function.

Existing alignment algorithms consider sequence alignment as a variation of the edit distance problem, and perform alignment by matching characters of the two sequences. As a result, they are unable to deal with regions of low information content such as repetitive and statistically biased DNA. Such regions are often "masked out" before alignment [19, 20]. Since genomic sequences are meant to convey genetic information, a new alignment methodology that performs alignment based on the information content at each nucleotide position is proposed here. The methodology is based on information theory [21] and the Minimum Message Length (MML) principle [22, 23]. This approach considers regions that convey similar information as potential homologues. The similarity of regions can be measured by their mutual information content.

A number of information theoretic methods have been developed to compare biological sequences. The MML encoding method [24] postulates that two sequences are related if compressing the two together results in a shorter code than the total code of compressing them separately. An extension of this information theoretic approach to alignment is Modelling-Alignment (M-Align) [25] which incorporates population models into the alignment process and can thus estimate the information content of each nucleotide or amino acid in context, and can change matching, insertion and deletion scores accordingly. The method has been shown to significantly reduce false positives without introducing false negatives when applied to statistically biased data. However, the quadratic complexity of M-Align prohibits applying it to long sequences.

This article presents XMAligner, a novel method for genomic local alignment based on information theory. As in [25, 26], our work is based on the premise that if two sequences are related, one sequence must tell something useful about the other: A predictive model can predict a sequence better if a related sequence is known. The information content of a sequence is measured by lossless compression. XMAligner makes use of the expert model compression algorithm [27, 28] for calculating the information content and mutual information content of the two sequences to be aligned. It does not require masking out of repetitive and low information regions. It has an objective function to help in selecting parameters for a good alignment. The method is shown to be practical and can handle sequences of eukaryote genome size.


Information theory [21] directly relates entropy to the transmission of a sequence under a compression model. Suppose a sequence X is to be transmitted over a reliable channel where the objective is to minimise the transmitted message. The sender compresses X using a compression model and transmits the encoded message to the receiver, which decodes the compressed stream, using the same model, to recover the original message. The compression is performed by the best possible compression model. The amount of information contained in X, or the information content (X) of X, is the amount of information actually transmitted across the channel, that is the length of the compressed message.

The transmission of X is illustrated in Figure 1a. The sender uses a predictive model, which compresses each symbol of X by estimating the probability of the symbol based on observation of the preceding symbols; a good prediction results in a short code-word for the symbol. The information content of every symbol makes up the information sequence of X, which is shown in the plot below the diagram.
Figure 1

The transmission of sequence X with a reference sequence Y. In Figure 1a, the transmission of a sequence X is alleviated by a compression model which uses a predictive model based on Markov experts (Markov models). The information content of each position is plotted in the graph below. With the presence of a related reference sequence Y , the compression model makes use of align experts, which exploit the similarity of the two sequences, for better compression (as shown in Figure 1b).

Suppose a reference sequence Y related to X is available to both parties. The sender can further reduce the transmitted message length by transmitting only the information in X that is not contained in Y with the addition of references to the shared information contained in Y. The receiver can recover X correctly because it also knows Y. Since the sender aims to send the shortest possible, recoverable message, the amount of information transmitted in this case should be no more, and probably less, than the amount of information transmitted without the reference sequence The amount of information transmitted in the presence of the reference sequence Y is called the conditional information content of X given Y , denoted (X|Y ). The sender is said to perform compression of X on the background of Y. The reduction in compressed message length caused by the presence of the reference sequence is due to the shared information between the two sequences, and hence indicates the amount of mutual information of the two sequences. The mutual information of X and Y is denoted as (X; Y ) = (X)- (X|Y ).

The transmission in the example above, but with a reference sequence, Y , is illustrated in Figure 1b. The predictive compression model now combines the information from all preceding symbols of X with the information from Y to estimate the probability of each symbol of X. If X and Y are truly related, the conditional information content of each symbol in X, given Y , will, on average, be lower than its information content without Y. The plot in the figure shows the sequence of information content of X, and the sequence of conditional information content of X given the reference sequence Y. One can notice a region in X that has a related region in Y - showing significantly lower conditional information content given Y.

A local alignment of two sequences shows the mapping of similar regions in the two sequences and hence reveals the references to shared information contained in the sequences. The local alignment thus allows a reduction in transmission of a sequence in the presence of the other sequence as the reference sequence. This observation leads to the proposition that optimal alignment of two sequences leads to the best compression of one sequence on the background of the other. An alignment algorithm is developed based on the proposition. It uses a compression model, which makes use of a local alignment, to compress a sequence on the background of a reference sequence, and suggests the alignment that gives the best compression. The quality of an alignment can be measured by the compression.

The expert model

The alignment algorithm presented here is largely based on the expert model (XM) compression model [27]. XM has been proved to be superior to other existing compression models thus giving the best estimate of the information content of sequences. In addition, its speed allows it to be applied to long sequences. Importantly, the expert model allows the compression of a sequence on the background of another, and can show references to the areas where better compression is achieved. These references make up the local alignment of the two sequences.

XM is a predictive model which can be used for compression of genomic sequences as well as to measure the information content of a sequence. It compresses each symbol of a sequence X by forming the probability distribution for the symbol based on the information from all symbols seen previously. The actual symbol is then encoded with respect to the probability distribution. The information content of the symbol is the theoretical length of the encoding of the symbol: (x i ) = -log2Pr(x i ).

In order to form the probability distribution of a symbol, the algorithm maintains a set of experts, whose predictions of the symbol are combined into a single probability distribution. An expert is any model that can potentially provide a reasonable probability distribution for the symbol. With the availability of a reference sequence, the sender and the receiver can recruit experts that base their predictions on the reference sequence. Expert opinions about the symbol are blended to give a combined prediction for the symbol. The reliability of an expert is evaluated from its past predictions. A reliable expert is given a high weight in the combination while an unreliable one has little influence on the prediction or may be even ignored.

Type of experts

An expert can be anything that provides a reasonably good probability distribution for the symbol at a position in the sequence. A simple example is the order m Markov expert which uses a Markov model learnt from the statistics of all previous symbols to give the probability of the symbol in the context of m preceding symbols. Initially, the Markov expert does not have any prior knowledge of the sequence and thus gives a uniform distribution to a symbol. As the encoding proceeds, the Markov expert gives the probability that a nucleotide appears in the next position as the frequency of its occurring previously. Essentially, the Markov expert provides the background statistical distribution of nucleotides over the sequence. Different areas of a DNA sequence may have differing functions and thus may have different probability distributions. To account for this, another type of expert called the local Markov expert is employed. The local Markov expert estimates the probability of a symbol based on the statistics from the local history rather than the entire history of the sequence.

In order to align two sequences X and Y , the method attempts to compress sequence X (query sequence) on the background knowledge of sequence Y (reference sequence). It uses align experts each of which considers the region x n ..x n+l in X to be aligned to a region y m ..y m+l in Y. An align expert estimates the probability of symbol x n+i (i 0..l) based on the corresponding symbol y m+i . It uses an adaptive code [29], learned from its correct predictions and its mistakes in the region, to predict x n+i . Two techniques are available for an align expert to learn its probability distribution for prediction. First, in the counting technique, each align expert keeps track of the number of correct and incorrect predictions, and gives the following probability to the letter at y m+i :
P r ( x n + i = y m + i ) = p = r + 1 w + 2

where w is the window size over which the expert reviews its performance and r is the number of correct predictions the expert has made; the remaining probability, 1 - p, is distributed evenly to the other letters of the alphabet. Second, in the substituting technique, each align expert maintains a substitution matrix and give predictions according to the matrix.

If there is a mutation, the align expert gives a bad prediction at the position of the change, and its weight is decreased. However, subsequent correct predictions restore its influence in the combined prediction. On the other hand, when the homologous region ends, the align expert makes several mistaken predictions and its weight quickly decreases. When the weight of the expert drops to below a threshold, the expert is removed from the panel. This also happens when an insertion or a deletion occurs - the align expert is no longer able to make good predictions and is eventually excluded to make room for other align experts. Though each align expert can only utilise a gap free matching region for prediction, many align experts collectively can handle larger regions that contain deletions and insertions.

Proposing align experts

When a symbol of query sequence X is encoded, there are 2|Y | possible align experts. This is too many to combine efficiently and anyway most are not genuine and thus would be ignored. To be efficient, the algorithm must use at most a small number of align experts at one time. The algorithm has a parameter L, which specifies the maximum number of align experts in use. When the expert panel size is less than L, the algorithm may recruit more potential align experts. Since the number of experts must be small to be efficient, it is desirable that the experts proposed are those most likely to be genuine experts.

A simple method to propose potential experts is by using a hash table. The hash table associates every position in the reference sequence with the hash key composed of k symbols preceding the position. It proposes experts that suggest the current symbol is homologous to the symbols in positions in Y having the same hash key. The choice of hash key size, k, and expert limit, L, is a trade-off between running time and compressibility, and hence alignment quality. Generally, a small k and a large L allow XMAligner to search for repeats more thoroughly and thus give better compression at the cost of more time.

Several techniques can be used to allow the hash table to propose align experts based on non-exact matching. There are two groups of nucleotides - purine (C and T) and pyrimidine (A and G). The biological properties of two nucleotides in a group are more similar than those from different groups. Therefore, substitutions changing nucleotides in a group (transitions) are more common than those that change the group (transversions). In order to permit mismatches in seeds, XMAligner provides an option to use the hash table on the alphabet {purine, pyrimidine}. Another technique is using gapped hash tables [30] which allow selecting align experts based on matching with errors at specified positions in the hash key.

Alternatively, a suffix tree or a suffix array can be used to propose align experts. These suffix structures allow selecting potential align experts based on the longest possible matching, especially for long sequences where random matches tend to be numerous. With a suffix structure, XMAligner can recruit up to L align experts from the L longest matches. Suffix structures can also operate on the alphabet {purine, pyrimidine}, but cannot suggest align experts from matches with errors.

Combining expert predictions

Not only do experts adapt themselves based on the context of symbols they have seen, XMAligner also adaptively adjusts each expert's weight to reflect its accuracy in the given context. Good experts are assigned high weights. Even being nominated by the hash table, some align experts are just random matches and thus their predictions are not significantly better than the Markov experts. The algorithm must be able to exclude the by-random nominees to reduce noise and to be more efficient. Furthermore, a "genuine" align expert performs well only within a homologous region. Beyond this, it provides random predictions and thus should also be excluded. It is important that the algorithm is able to evaluate the goodness of each expert to assign a weight accordingly, and to exclude the expert when necessary.

The core part of the expert model is the evaluation and combination of expert predictions. Suppose at position n on the query sequence X, a panel of experts E is available to the compressor. Expert θ e gives the probability Pr(x n |θ e , x1..n-1) of symbol x n based on its observations of the preceding n - 1 symbols. The expert is assigned a weight w θ e which reflects its reliability. The expert model performs a linear blending of experts' predictions to give the probability distribution of the symbol x n :
P r ( x n | x 1.. n - 1 ) = θ e E w θ e P r ( x n | θ e , x 1.. n - 1 )
in which the sum of all weights is equal to 1:
θ e E w θ e = 1
A sensible way to combine experts' predictions is based on Bayesian model averaging which sets an expert's weight to its posterior probability after encoding the previous n - 1 symbols.
w θ e = P r ( θ e | x 1.. n - 1 )
As has been shown in [31], this posterior probability of θ e is proportional to the product of its predictions of the n - 1 symbols. Therefore
w θ e i = 1 n - 1 P r ( x i | θ e , x 1.. i - 1 )
Taking the negative log of the two sides in Equation 5 gives
- l o g 2 ( w θ e ) ~ - i = 1 n - 1 l o g 2 P r ( x i | θ e , x 1.. i - 1 )
In other words, the negative logarithm of w θ e varies linearly with the length of the encoded subsequence x1..n-1by expert θ e . To evaluate experts on a recent history of size h, only the message length of encoding symbols xn-h..n-1is used to determine the weights of experts. The final formula of w θ e is
w θ e 2 - m s g L e n ( x n - h .. n - 1 | θ e )

If a symbol is part of a homologous region, the align expert of that region must predict significantly better than a Markov expert. We therefore define a listen threshold, T, to determine the inclusion of an align expert. An align expert is considered reliable if the length of its encoding of the last h symbols is smaller that of the Markov experts by T bits. An align expert is expected to be involved in prediction of a homologous region. Beyond the region, its predictions becomes random and therefore its performance gets worse. If the align expert performance falls below the threshold, the expert is discarded to make way for others.

Identifying similar regions

The main idea behind our alignment algorithm is that if two sequences are related, one will tell something new and useful about the other, that would not be known otherwise. If a region R x in the query sequence X has some biological relationship with some region R y in the reference sequence Y , the similarity between R x and R y should be better than random. The align expert based on R y should perform better on R x than the Markov experts whose predictions are based purely on the general statistics of sequence X. We therefore consider a region conserved if there is an align expert that predicts significantly better than the Markov experts in the region due to the shared information between the region and a related region in the reference sequence. The amount of shared information, measured in bits, indicates the similarity of the two regions. The more information shared, the more similar they are. Such a region is called a High-scoring Segment Pair (HSP).

The method identifies HSPs by considering high performing align experts. Each align expert is typically proposed by the hash table at some point in the query sequence during the compression process. It takes part in the compression until being discarded from the expert panel. The align expert assumes that the region it predicts is related to a region in the reference sequence, and bases its prediction on the assumption. The two regions form an HSP; the score is determined by the difference between the performance of the align expert and the Markov experts.

This sub-section shows that the alignment score of an HSP [32] is in fact the mutual information content of the pair. Consider an align expert that aligns nucleotide x i in X to nucleotide y j in Y. The alignment score is specified by the logarithm of the odds ratio of a model H which assumes the two nucleotides are homologous, and a model R assuming they are random:
S ( x i , y j ) = l o g 2 P r ( x i , y j | H ) P r ( x i , y j | R )
Since model R assumes that the occurrence of x i in X and y j in Y are independent, the denominator of the right hand side can be expressed as Pr(x i , y j |R) = Pr(x i )Pr(y j ). On the other hand, model H considers symbol x i to be related to symbol y j and hence Pr(x i , y j |H) = Pr(x i |y j , H)Pr(y j ) by Bayes's theorem. Therefore,
S ( x i , y j ) = l o g 2 P r ( x i | y j , H ) P r ( y j ) P r ( x i ) P r ( y j ) = l o g 2 P r ( x i | y j , H ) - l o g 2 P r ( x i )
Pr(x i |y j , H) is the probability of symbol x i estimated by the align expert upon observing y j while Pr(x i ) is the probability of x i estimated by the Markov experts. S(x i , y j ) thus, is the mutual information of the two symbols. The alignment score of an HSP is the sum of alignment scores of all symbols in the regions. If the HSP is from two regions starting at x n and y m respectively and is l symbols long, its alignment score is
S ( x n , y m , l ) = i = 0 l - 1 - l o g 2 P r ( x n + i ) - i = 0 l - 1 - l o g 2 P r ( x n + i | y m + i , H )

The two terms are the lengths of the compressed messages of the region xn..n+l-1by the Markov experts, and by the align expert, respectively. In other words, the alignment score of an HSP is the mutual information content of the two regions.

An HSP is considered a homologue if its alignment score is greater than a fraction of the information content of the region from the query sequence. Specifically, XMAligner has a parameter homology ratio threshold r, and selects HSPs having alignment scores
S ( x n , y m , l ) > r i = 0 l - 1 - l o g 2 P r ( x n + i )

as the local alignment.

Once all the HSPs have been selected, overlapping HSPs and HSPs having distances less than a certain threshold are chained together to form larger regions. More specifically, two HSPs ( x m 1 , y n 1 , l 1 ) and ( x m 2 , y n 2 , l 2 ) where m1 < m2 are considered close if the distances between the end of HSP ( x m 1 , y n 1 , l 1 ) and the beginning of HSP ( x m 2 , y n 2 , l 2 ) in both sequences are less than a predefined gap. The alignment score of a chain is the sum of the alignment scores of all HSPs involved. The alignment algorithm is formally described in Algorithm 1.

Algorithm 1 Expert Model Alignment Algorithm

   XMAligner(Sequence X, Y)

   param L: limit on size of the expert panel E

   param k: size of the hash key

   param r: the ratio threshold to determine statistically significant HSPs.

   param h: size of the window to evaluate experts

   param T: threshold to discard align experts

   Use the hash table to index every position of the reference sequence

   E empty set

   for n 1 to |X| do

      while |E| < L do

         if expert θ e which matches y m to x n is proposed then

            add θ e into E

            set Start X (θ e ) n {The starting point of expert θ e in query sequence X}

            set Start Y (θ e ) m {The starting point of expert θ e in reference sequence Y }


            break {No expert is proposed}

      end if

      end while

      set P r ( x n ) θ e E w θ e P r ( x i | θ e ) where w θ e = 2 - m s g L e n ( x n - h + 1.. n | θ e )

      msgLen(x n ) -log2Pr(x n )

      for all θ e E do

         msgLen(x n e ) = -log2Pr(x n e ))

         update θ e

         if msgLen(x n-h ..x n e ) > msgLen(x n-h ..x n Markov ) - T then

            remove θ e from E

            set l n - Start X (θ e )

            form an HSP that matches x S t a r t X ( θ e ) , l with y S t a r t Y ( θ e ) , l .

            set score S ( H ) i - 0 l - 1 - l o g 2 P r ( x n - i | θ M a r k o v ) - i = 0 l - 1 - l o g 2 P r ( x n - i | θ e )

            if S ( H ) > r i = 0 l - 1 - l o g 2 P r ( x n - i | θ M a r k o v ) then

               Add the HSP to a list

            end if

         end if

      end for

   end for

   chain sufficiently close HSPs together


We ran experiments to compare the performance of XMAligner to several common genomic alignment algorithms. The criteria for selecting these algorithms was that (i) they can align long sequences, and (ii) they are available to install on a workstation. The alignment algorithms selected for comparison included Dialign [9], Chaos [14], Sim4 [7], Blastz [13] and Nucmer and Promer in the MUM-mer package [12]. Experiments were run on a work station equipped with an Intel dual core 2.66 Ghz CPU with 8 GB of memory. The machine ran Linux Ubuntu 9.04.

We consider the use of genomic alignment tools in the context of identifying interesting regions in the genomes which in many cases are related to homologous regions [33]. We therefore evaluated the performance of each algorithm based on its ability to detect homologues. In statistics, sensitivity is defined as S n = T P T P + F N and precision is defined as S p = T P T P + F P , where TP is the number of true positives, FP is the number of false positives, and FN is the number of false negatives. What constitutes a true positive etc. depends on what question is asked. The literature takes two approaches: (1) Does the method correctly identify that a segment of the query sequence is related to some segment or segments of the reference sequence? (2) Does the method correctly identify the exact base in the reference sequence to which a base within a segment of the query sequence corresponds? Clearly, both questions have their place.

We consider true positives (TP) to be the number of homologous nucleotides that are correctly predicted as homologous (i.e., are aligned with some nucleotides in the reference sequence by the alignment tool), true negatives (TN) to be the number of non-homologous nucleotides that are correctly predicted as non-homologous, false positives (FP) to be the number of non-homologous nucleotides that are incorrectly predicted to be homologous, and false negatives (FN) as the number of homologous nucleotides that are incorrectly predicted to be non-homologous. This definition corresponds to asking question (1) above.

In statistics, specificity is traditionally defined as T N T N + F P . However, for alignments there are generally many fewer homologous regions, and thus homologous nucleotides, than non-homologous regions. So TN tends to be much higher than FP , making the traditional formula uninformative. Consequently, the formula for Sp is typically used for specificity in alignment applications [34]. These same definitions - Sn and Sp with respect to question 1) - have been used to compare tools for coding regions identification [14, 33]. Some work [13, 35] addressing question (2) above, define a quantity called alignment coverage; this happens to be equivalent to Sn for question (1)! Although this quantity does not necessarily account for the exact matching of nucleotides, it is expected to be "highly correlated with alignment sensitivity" for question (2) [[36], p. 764]. In words, the definitions used herein are: sensitivity (Sn) is the fraction of homologous nucleotide sites covered by the alignments predicted; and specificity (Sp) is the fraction of homologous nucleotide sites predicted that are true homologues. Where possible, the receiver operator characteristics (ROC) curve, plotting sensitivity against specificity, for each algorithm is presented.

Simulated data

An evaluation of an alignment tool compares the homologues predicted by the tool against "true" homologues. True homologues in genomes, however, are not always reliable as they are often located by automated tools or by subjective prediction by human experts. Some alignment benchmarks based on real data such as BAliBASE [37] and Jareborg [38] were designed based on manually curated alignments and structure protein information. These benchmarks are therefore only restricted to short sequences, and to homologues from protein coding regions. Since some conserved regions are not necessarily protein coding, these benchmark data sets may cause alignment tools to report "wrong" false positives. Simulated data benchmarks, such as those proposed in [35] and [39], are guaranteed to provide the true answers to alignment. The use of simulated data sets also allows exploring the entire spectrum of the problem space. These benchmarks, however, contain only short homologous sequences (1 kb - 10 kb) and are only suitable for global alignment tools. They thus do not meet our goal of evaluating genome alignment tools.

We first experimented using simulated data. We generated our artificial genome benchmark data set in which homologous regions are scattered around the genomes in a random order. These homologous regions were taken from the alignment benchmark in [39] for which the generation was inspired by non-coding regions from the Drosophila genomes. We selected ten alignments at random from their 10000 alignments. Each alignment contains homologous sequences that were generated based on homologous non-coding regions of five species Drosophila melanogaster, Drosophila simulans, Drosophila yakuba, Drosophila ananassae and Drosophila mojavensis. Each sequence is 1000 bases long. We generated five unrelated simulated genomes of length 100 kb, and inserted the ten homologous sequences of each species into a simulated genome at random positions. The generation resulted in five simulated genomes, each of which contains ten homologous regions.

We performed local pairwise alignment of the simulated genome containing D. melanogaster homologous sequences against each of the other four genomes. The object of the alignment was to locate the homologous sites from each genome. Sites resulting from insertions were not considered homologous. The data set consists of four pairs of simulated genomes, namely, D. melanogaster - D. simulans, D. melanogaster - D. yakuba, D. melanogaster - D. ananassae and D. melanogaster - D. mojavensis in order of increasing genetic distance. In order to investigate different statistical distributions, we generated two sets with different statistical properties from these four pairs. In the first set, unrelated regions were generated from a uniform distribution (uniform set). In the second set, unrelated regions were generated from a statistically biased distribution in which the frequencies of A, C, G and T are 40%, 10%, 10% and 40% respectively (biased set). In total, our benchmark contained eight pairs of simulated genomes.

The programs XMAligner, Dialign [9], Chaos [14], Nucmer [12] and Blastz [13] were applied to each pair of sequences. Promer and Sim4 were not included because they either perform alignment at the amino acid level, or rely on finding exon boundaries, whereas the data generated exhibit substitutions at the nucleotide level. Furthermore, the simulated homologous regions are not actual coding regions and hence cannot sensibly be translated to protein. For each program used, we made an effort to choose the best possible parameters for a specific pair of sequences. We then varied one parameter to get different values of sensitivity and specificity of each algorithm. In particular, for Chaos, we varied the score cut-off (co) and set the word length (wl) to 10; for Dialign, we varied the threshold (thr); for Nucmer, we varied min cluster (c) and set minmatch (l) to 14 and maxgap (g) to 120; for Blastz, we varied scoring threshold (hspthresh); for XMAligner, we varied homology ratio threshold (r) and set the hash key size to 10. All other parameters were set to their default values for DNA alignment.

Figure 2 and Figure 3 show the performance of these algorithms on the four sequence pairs in the uniform and biased sets, respectively. Generally, the performance of the algorithms deteriorated with increasing genetic distances. In all cases, XMAligner, Nucmer and Blastz were clearly superior to Chaos and Dialign. On the uniform set, XMAligner performed comparably to Nucmer. Blastz was the most sensitive among the five programs. However, it was less specific than XMA-ligner and Nucmer on distantly related sequence pairs such as D. melanogaster - D. ananassae and D. melanogaster - D. mojavensis. On the biased set, XMAligner outperformed both Blastz and Nucmer, especially on distantly related sequences. In such biased data, spurious matches occur more often than in more uniformly distributed data. As a result, Blastz, Chaos and Nucmer were misled by the bias of the data. On the other hand, XMAligner examines the information content of every nucleotide. In a low information region, the information content of a non-homologous nucleotide is calculated accordingly and thus spurious matches reported are minimised.
Figure 2

Comparative performance on the uniform set.

Figure 3

Comparative performance on the biased set.

We performed an experiment to verify the proposition that the best alignment of two sequences leads to the best compression of a sequence on the background of the other. The experiment was performed on the four biased genome pairs. We first varied the parameters of the compression model, namely the hash table key size, the context length and the expert panel limit, so that different compression results could be obtained. The compression performance of each set of parameters is measured by the average compression of the simulated D. melanogaster genome in each pair. For each set of parameters, we varied the homology ratio threshold to obtain different sensitivity and specificity values. The ROC curve for each set of model parameters is displayed in Figure 4, and is labelled by the compression result, in bit per symbol. The two configurations that produced the best compression results, 1.6969 bps and 1.6974 bps, also gave the best alignment performance. On the other hand, the configurations that produced the worst compression results (1.6992 bps and 1.7012 bps) were inferior to other configurations set up in the experiment.
Figure 4

Relationship between compressibility and alignment performance.

Human-Mouse data set

We also performed experiments on real data. We used the Jareborg data set [38] which contains 42 annotated pairs of genomic sequences from the mouse and human genomes. These sequences vary in length between 6 kilobases to 220 kilobases, with an average length of 38 kilobases. They contain 77 verified exon pairs. As exons are under stronger selective pressure, they tend to be more conserved than non-coding regions. The performance of an alignment algorithm is often evaluated by its ability to detect exons. Indeed, the data set was used to evaluate alignment algorithms in several previous studies [14, 33].

For a pair from the data set, we applied each algorithm to align the mouse sequence against the human sequence, and compared the HSPs detected in the mouse sequence to the annotated mouse exons. The parameters for XMAligner, Chaos, Dialign, Nucmer and Blastz were the same as in the previous experiment. For Promer, we varied min cluster (c) and set minmatch (l) to 6 and maxgap to 30; for Sim4, we varied HSP threshold (C) and set word size (W) to 10. The sensitivity versus specificity ROC curves for these algorithms are plotted in Figure 5. In general, XMAligner was the most sensitive among the algorithms in the experiment. In particular, it outperformed Blastz Chaos and Nucmer which also align sequences at the DNA level. Other methods, which either translate potential exons to proteins and perform alignment at the protein level (Promer and Dialign) or use a built-in exon boundary detection mechanism, are more specific.
Figure 5

Performance comparison on Human-Mouse data set.

Malaria parasite genomes

We used XMAligner to align the genomes of five Plasmodium species, namely P. falciparum, P. knowlesi, P. vivax, P. gallinaceum and P. yoelii. The genome sequences and their annotations were obtained from PlasmoDB release 6.2 [40]. Of the five species, P. falciparum and P. vivax are malaria parasites on human while P. knowlesi and P. yoelii cause malaria in monkey and rodent respectively. P. gallinaceum is a bird malaria parasite. The nucleotide compositions in these genomes are very different. The AT content in the genome of P. falciparum is as high as 80% genome-wide, even 90% in introns and intergenic regions, while the AT content in the P. vivax genome is just 57.60%.

The genomes of Plasmodium species exhibit an extremely difficult example of sequence alignment. The highly skewed distributions of genomes of species such as P. falciparum, especially in non-coding regions, may lead to the return of spurious matches. Furthermore, in different stages of their life-cycle, Plasmodium species interact with the mosquito vector and the vertebrate host. The strong evolutionary pressure from these interactions has resulted in different codon preferences among the genomes of Plasmodium species. Indeed, the AT content of coding regions of P. falciparum is as high as 76% while the AT content of coding regions of another human malaria parasite, P. vivax is only 53%, although the two species have similar metabolic pathways and their proteins share a high level of identity [41].

We aligned each of the P. falciparum and P. knowlesi genomes against each of four other genomes and against the concatenation of these four genomes. The similar regions detected during alignment were compared with the exon annotation. We compared XMAligner with Blastz [13], Promer and Nucmer [12], which are the only three among the chosen programs able to align such long sequences. Blastz and Nucmer align the sequences at the nucleotide level while Promer translates potential exons to protein and aligns at the protein level. Promer is generally used when the sequences are relatively divergent, which Nucmer cannot handle. We varied the parameters scoring threshold (hspthresh) of Blastz, minimum cluster (c) of Nucmer and Promer, and homology ratio threshold (r) of XMAligner to get several different values of sensitivity. Other options are presented in Table 1 and Table 2.
Table 1

Sensitivity and specificity of exon detection from the P. falciparum genome

Method & params






Total Time (Mins)


Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)


XMAligner -hashSize = 20 -binaryHash = true -limit = 500

r = 0.15












r = 0.25












r = 0.35












Promer -l 6 -g 30

c = 10












c = 20












c = 40












Nucmer -l 14 -g 160

c = 40












c = 65












c = 90












Blastz -notransition -step = 20 -nogapped

t = 3000












t = 5000












t = 7000












Table 2

Sensitivity and specificity of exon detection from the P. knowlesi genome

Method & params






Total time (Mins)


Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)

Sen. (%)

Spe. (%)


XMAligner -hashSize = 20 -binaryHash = true-limit = 500

r = 0.15












r = 0.25












r = 0.35












Promer -l 6 -g 30

c = 10












c = 20












c = 40












Nucmer -l 14 -g 160

c = 40












c = 65












c = 90












Blastz -notransition -step = 20 -nogapped

t = 3000












t = 5000












t = 7000












The alignment of one genome against another by XMAligner took about 40 minutes. To get high sensitivity, we performed alignment in both forward and reverse directions, and then combined both alignments. The total time for alignment of a pair of sequences therefore was about 80 minutes. The running time of Promer was shorter, about 4 to 5 minutes for alignment one genome against another, and 20 minutes to align one genome against the four other genomes. Nucmer is even faster, it needed only one minute for pairwise alignment and four minutes for aligning one against four genomes.

The sensitivity and specificity of exon detection of the three programs on the genomes of P. falciparum and P. knowlesi are shown in Table 1 and Table 2 respectively. A column with the header X/Y shows the performance of aligning the genome of × against the genome of Y and a column with header X/ALL shows the performance of aligning the genome of × against the other four genomes.

Nucmer performed poorly on most cases, with the exception of aligning the P. knowlesi genome against P. vivax, these being closely related. In the alignment of distantly related genomes, Nucmer obtained a sensitivity of no more than 20% in most cases. Promer performed significantly better than Nucmer on the data, although the matching techniques of the two algorithms are similar, except that Promer performs alignment at the protein level while Nucmer aligns at the nucleotide level. Blastz performed better than Nucmer, but was inferior to Promer on aligning these sequences.

Although XMAligner aligns sequences at the nucleotide level (i.e., it does not take exons and protein into account), it showed a much higher level of both sensitivity and specificity than Promer in the alignment of most pairs. The only exception is the closely related pair P. knowlesi and P. vivax, where XMAligner was more sensitive but less specific. With such a close relationship, many regions other than exons also tend to be conserved. While Promer translates DNA to proteins for alignment, the annotation of just codons is clearly advantageous to Promer's specificity.

Visualisation of alignment

We have incorporated the output of XMAligner into InfoV toolkit [42] for visualisation. When aligning a sequence X against a sequence Y , XMAligner outputs the sequence of information content of X and the sequence of the conditional content of X given Y , along with a list of HSPs. The toolkit can read these information sequences, manipulate and display them. The annotation of the sequences can also be visualised by the toolkit.

In an earlier publication [43], we performed an alignment experiment using XMAligner and InfoV toolkit. We downloaded the P. vivax and P. falciparum genomes from PlasmoDB version 5.4. We applied XMAligner to align contig ctg6843 from the P. vivax genome against the genomes of P. falciparum. The information content sequence of the contig and the conditional information content sequence of the contig given the P. falciparum genome were generated by XMAligner. The information content sequences were loaded into InfoV for viewing. The visualisation of these information sequences and the alignment is shown in Figure 6. The top canvas plots the two information sequences. The mutual information, obtained by taking the difference of the two information sequences, is plotted in the bottom canvas.
Figure 6

Visualisation of the alignment of the P. vivax contig ctg6843 against the P. falciparum genome.

InfoV is able to display the annotations of a sequence and the HSPs from an alignment. The two rows of red and blue boxes near the bottom of the viewer in Figure 6 display the HSPs from the alignment and the exon annotation of contig ctg6843 from PlasmoDB version 5.4. When a box is clicked, a pop up windows shows the relevant information of the HSP or of the annotation. Users can zoom in and out to view particular areas of interest. Figure 6 shows the view from position 485000 to 510000 of the contig.

During our experiment, we noticed a cluster of HSPs which paired regions in contig ctg6843 to some annotated coding regions in the genome of P. falciparum. These regions showed a high level of similarity but was not annotated in PlasmoDB 5.4 version. The cluster of these region starts at position 491038 in the ctg6843, and is about 15000 bases long. Its counterpart from the P. falciparum genome starts at position 6971447. We tracked down and found that this area in the P. falciparum genome is a cluster of three genes MAL7P1.203, MAL7P1.320 and MAL7P1.204. The information of the alignment of an HSP is shown in Figure 6. The area was thought to be a synteny region conserved across malaria species, and contain some genes [43]. A later version of PlasmoDB (release 6.2 [40]) verified this finding and annotated the area as gene PVX 081792 in the P. vivax genome.


Most genomic alignment methods have four major components: (i) an indexing technique for locating seeds, (ii) a method for extending seeds, (iii) a method for assigning score to each local alignment, and (iv) a method to evaluate the significance of an alignment. XMAligner presents novel technique for (ii), (iii) and (iv) while it can use any existing methods for (i) from conventional alignment approaches for to propose align experts. Indeed, XMAligner provides option to use hash tables, gapped hash table, suffix trees and suffix arrays, on the standard alphabet (i.e., A, C, G and T) or on the {purine, pyrimidine} alphabet. Other techniques will be implemented in the near future. Most importantly, the suitability of each seeding technique can be measured by the compression objective function.

With reference to the traditional dynamic programming approach, an align expert proceeds diagonally. This is similar to gap-free extending seeds. However, there can be more than one align expert employed at any time. If there are gaps in a homologous region, some neighbouring expert(s) would be proposed. Though each align expert can suggest a gap-free HSP, the panel of experts in XMAligner can handle gaps implicitly. This also allows XMAligner not to make any assumptions about gap scores.

The matching scores in the traditional dynamic programming approach are calculated based on an information theory perspective [32]. Indeed, an entry in the common substitution matrices such as PAM [44] and BLOSUM [45] represents the logarithm of the ratio of the probabilities of two hypotheses: the pair is homologous and the pair is random. These scores are calculated based on some pre-aligned data or under some evolutionary assumptions. These substitution matrices are therefore not suitable for alignment of sequences that have different properties to the data used to construct the matrices, such as sequences of biased composition. A previous attempt has been made to construct substitution matrices for such sequences by collecting pre-aligned sequences with similar composition statistics [46]. However, the suitability of the collected data and the reliability of the pre-alignment are called into question. We argue that it is desirable to estimate these probabilities from the sequences at hand. This calculation better reflects the information content of each symbol of the sequences to be aligned. These scores can even be estimated if the sequences are sufficiently long [31].

Equation 11 shows that the mutual information of an HSP is in fact the traditional alignment score of the HSP which is also measured by the logarithm of the odds ratio of the probability that two symbols are related and the probability that they are independent. However, XMAligner adaptively estimates these probabilities based on the context of the pair of symbols. For example, in a low information region, the information content of a more frequent symbol is lower and its alignment score is computed accordingly. Unlike the "pairwise statistical significance" approach in [47] which locally selects a scoring scheme from a pre-computed set, our approach estimates the scoring scheme directly from data. This mechanism of XMAligner also differs from other methodologies in dealing with biased composition data; for example in [48] where the scoring scheme is derived from the standard substitution matrix by an heuristic transformation and in [49] which estimates the statistical significance E-value from data. Furthermore, each align expert also adaptively estimates mutation rates based on its observed data and keeps a separate scoring scheme. With the compression criterion, experts with good scoring scheme are retained while experts with unreasonable scoring scheme are discarded early. As a result, the new methodology performs better than traditional methods on statistically biased data, as demonstrated in the Results section.

XMAligner might find multiple segments in the reference sequence that are strongly related to a similar segment in the query sequence. The degree of relatedness is specified by the conditional information content of the segment given each related segment on the reference sequence. This can be used as a ranking to guide further investigation of such an identified segment.

Most existing alignment algorithms lack an objective function to indicate which parameters are the most suitable for the data. Objective functions are very important for applications like sequence alignment because biological data are so diverse. It is very hard to anticipate which parameter values capture the essence of the data and will give the best results, especially for data that are not well studied. The objective function provided by XMAligner naturally guides parameter estimation and improves alignment quality.


This article presents XMAligner, a novel sequence alignment approach that matches long sequences at the information content level. It considers the information content of the nucleotide at each position during the alignment process. The information content is determined by examining the context of the nucleotide. Unlike traditional alignment algorithms, XMAligner reports aligned regions from two sequences if there is significant shared information between the two regions. The approach is shown to outperform the conventional character-matching approaches, especially for distantly related sequences and sequences with statistically biased composition. The method is able to align eukaryote genomes with only a modest hardware requirement. The output from XMAligner can be integrated into a visualisation tool to aid the analysis of sequences.

We argue that, since genomic sequences are meant to carry information, aligning in terms of information content is a better approach for genomic sequence alignment. Each nucleotide should be examined within its context. The approach is better suited than the conventional approaches which measure the alignment score of matching symbols entirely based on a fixed scoring scheme.



The authors would like to thank Robert Huestis for drawing our attention to details of malaria parasites and for many helpful discussions on the genomes of Plasmodia. We are grateful to Linda Stern for many comments on an earlier version of the manuscript.

Authors’ Affiliations

Clayton School of Information Technology, Monash University


  1. Needleman SB, Wunsch CD: A General Method Applicable to the Search for Similarities in the Amino Acid Sequences of Two Proteins. Journal of Molecular Biology 1970, 48: 443–453. 10.1016/0022-2836(70)90057-4View ArticlePubMedGoogle Scholar
  2. Smith TF, Waterman MS: Identification of Common Molecular Subsequences. Journal of Molecular Biology 1981, 147: 195–147. 10.1016/0022-2836(81)90087-5View ArticlePubMedGoogle Scholar
  3. Pearson WR, Lipman DJ: Improved Tools for Biological Sequence Comparison. Proceedings of the National Academy of Sciences 1988, 85(8):2444–2448. 10.1073/pnas.85.8.2444View ArticleGoogle Scholar
  4. Altschul SF, Gish W, Miller W, Myers E, Lipman D: Basic Local Alignment Search Tool. Journal of Molecular Biology 1990, 215: 403–410.View ArticlePubMedGoogle Scholar
  5. Fleischmann RD, Adams MD, White O, Clayton RA, Kirkness EF, Kerlavage AR, Bult CJ, Tomb JF, Dougherty BA, Merrick JM, McKenney K, Sutton G, FitzHugh W, Fields C, Gocayne JD, Scott J, Shirley R, Liu LI, Glodek A, Kelley JM, Weidman JF, Phillips CA, Spriggs T, Hedblom E, Cotton MD, Utterback TR, Hanna MC, Nguyen DT, Saudek DM, Brandon RC, Fine LD, Fritchman JL, Fuhrmann JL, Geoghagen NSM, Gnehm CL, McDonald LA, Small KV, Fraser CM, Smith HO, Venter JC: Whole-genome random sequencing and assembly of Haemophilus influenzae Rd. Science 1995, 269(5223):496–512. [] 10.1126/science.7542800View ArticlePubMedGoogle Scholar
  6. Altschul SF, Madden T, Schaffer A, Zhang J, Zhang Z, Miller W, Lipman D: Gapped BLAST and PSI-BLAST: a New Generation of Protein Database Search Programs. Nucleic Acids Research 1997, 25(17):3389–3402. [] 10.1093/nar/25.17.3389View ArticlePubMedPubMed CentralGoogle Scholar
  7. Florea L, Hartzell G, Zhang Z, Rubin GM, Miller W: A Computer Program for Aligning a cDNA Sequence with a Genomic DNA Sequence. Genome Research 1998, 8: 967–974.PubMedPubMed CentralGoogle Scholar
  8. Ning Z, Cox AJ, Mullikin JC: SSAHA: A Fast Search Method for Large DNA Databases. Genome Research 2001, 11(10):1725–1729. [] 10.1101/gr.194201View ArticlePubMedPubMed CentralGoogle Scholar
  9. Morgenstern B: DIALIGN 2: Improvement of the Segment-to-segment Approach to Multiple Sequence Alignment. Bioinformatics 1999, 15: 211–218. 10.1093/bioinformatics/15.3.211View ArticlePubMedGoogle Scholar
  10. Höhl M, Kurtz S, Ohlebusch E: Efficient Multiple Genome Alignment. Bioinformatics 2002, 18(Suppl. 1):S312-S320. []View ArticlePubMedGoogle Scholar
  11. Delcher AL, Phillippy A, Carlton JM, Salzberg SL: Fast Algorithms for Large-scale Genome Alignment and Comparison. Nucleic Acids Research 2002, 30(11):2478–2483. [] 10.1093/nar/30.11.2478View ArticlePubMedPubMed CentralGoogle Scholar
  12. Kurtz S, Phillippy A, Delcher AL, Smoot M, Shumway M, Antonescu C, Salzberg S: Versatile and Open Software for Comparing Large Genomes. Genome Biology 2004., 5(2): [] 10.1186/gb-2004-5-2-r12
  13. Schwartz S, Kent WJ, Smit A, Zhang Z, Baertsch R, Hardison RC, Haussler D, Miller W: Human-Mouse Alignments with BLASTZ. Genome Research 2003, 13: 103–107. [] 10.1101/gr.809403View ArticlePubMedPubMed CentralGoogle Scholar
  14. Brudno M, Chapman M, Gottgens B, Batzoglou S, Morgenstern B: Fast and Sensitive Multiple Alignment of Large Genomic Sequences. BMC Bioinformatics 2003, 4: 66. [–2105/4/66] 10.1186/1471-2105-4-66View ArticlePubMedPubMed CentralGoogle Scholar
  15. Bray N, Dubchak I, Pachter L: AVID: A Global Alignment Program. Genome Research 2003, 13: 97–102. 10.1101/gr.789803View ArticlePubMedPubMed CentralGoogle Scholar
  16. Batzoglou S: The Many Faces of Sequence Alignment. Brief Bioinform 2005, 6: 6–22. [] 10.1093/bib/6.1.6View ArticlePubMedGoogle Scholar
  17. Gusfield D, Balasubramanian K, Naor D: Parametric Optimization of Sequence Alignment. In SODA '92: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics; 1992:432–439.Google Scholar
  18. Comeron JM, Aguade M: An Evaluation of Measures of Synonymous Codon Usage Bias. Journal of Molecular Evolution 1998, 47(3):268–274. 10.1007/PL00006384View ArticlePubMedGoogle Scholar
  19. Wootton JC, Federhen S: Statistics of local complexity in amino acid sequences and sequence databases. Computers & Chemistry 1993, 17(2):149–163. [–45/2/5ecbb4a876d356f8572bde2b43015788] 10.1016/0097-8485(93)85006-XView ArticleGoogle Scholar
  20. Wootton JC: Simple sequences of protein and DNA. In DNA and Protein Sequence Analysis: A Practical Approach. Edited by: Bishop MJ, Rawlings CJ. Oxford University Press; 1997:169–183.Google Scholar
  21. Shannon CE: A Mathematical Theory of Communication. The Bell System Technical Journal 1948, 27: 379–423. []View ArticleGoogle Scholar
  22. Wallace CS, Boulton DM: An Information Measure for Classification. Computer Journal 1968, 11(2):185–194.View ArticleGoogle Scholar
  23. Wallace CS: Statistical and Inductive Inference by Minimum Message Length. Information Science and Statistics Series, Springer; 2005.Google Scholar
  24. Allison L, Yee CN: Minimum Message Length Encoding and the Comparison of Macromolecules. Bulletin of Mathematical Biology 1990, 52(3):431–452.View ArticlePubMedGoogle Scholar
  25. Powell DR, Allison L, Dix TI: Modelling-Alignment for Non-random Sequences. AI 2004: Advances in Artificial Intelligence 2004, 203–214. []View ArticleGoogle Scholar
  26. Allison L, Wallace CS, Yee CN: Finite-state Models in the Alignment of Macromolecules. Journal of Molecular Evolution 1992, 35: 77–89. 10.1007/BF00160262View ArticlePubMedGoogle Scholar
  27. Cao MD, Dix TI, Allison L, Mears C: A Simple Statistical Algorithm for Biological Sequence Compression. Data Compression Conference 2007, 43–52. []Google Scholar
  28. Cao MD, Dix TI, Allison L: A Biological Compression Model and its Applications. In Software Tools and Algorithms for Biological Systems. Springer; 2011:in press.Google Scholar
  29. Boulton DM, Wallace CS: The Information Content of a Multistate Distribution. Journal of Theoretical Biology 1969, 23(2):269–278. 10.1016/0022-5193(69)90041-1View ArticlePubMedGoogle Scholar
  30. Keich U, Li M, Ma B, Tromp J: On Spaced Seeds for Similarity Search. Discrete Appl Math 2004, 138(3):253–263. 10.1016/S0166-218X(03)00382-2View ArticleGoogle Scholar
  31. Cao MD, Dix TI, Allison L: Computing Substitution Matrices for Genomic Comparative Analysis. PAKDD 2009, LNAI 5476 2009, 647–655.Google Scholar
  32. Altschul SF: Amino Acid Substitution Matrices from an Information Theoretic Perspective. Journal of Molecular Biology 1991, 219(3):555–565. [–4FNGD09–4X/2/a0f9e00dbe41135c2072a3f7463c46d6] 10.1016/0022-2836(91)90193-AView ArticlePubMedGoogle Scholar
  33. Morgenstern B, Rinner O, Abdeddaim S, Haase D, Mayer K, Dress A, Mewes HW: Exon Discovery by Genomic Sequence Alignment. Bioinformatics 2002, 18: 777–787. 10.1093/bioinformatics/18.6.777View ArticlePubMedGoogle Scholar
  34. Burset M, Guigó R: Evaluation of Gene Structure Prediction Programs. Genomics 1996, 34(3):353–367. 10.1006/geno.1996.0298View ArticlePubMedGoogle Scholar
  35. Pollard DA, Bergman CM, Stoye J, Celniker SE, Eisen MB: Benchmarking Tools for the Alignment of Functional Noncoding DNA. BMC Bioinformatics 2004, 5: 6. [–2105/5/6] 10.1186/1471-2105-5-6View ArticlePubMedPubMed CentralGoogle Scholar
  36. Margulies EH, Cooper GM, Asimenos G, Thomas DJ, Dewey CN, Siepel A, Birney E, Keefe D, Schwartz AS, Hou M, Taylor J, Nikolaev S, Montoya-Burgos JI, Löytynoja A, Whelan S, Pardi F, Massingham T, Brown JB, Bickel P, Holmes I, Mullikin JC, Ureta-Vidal A, Paten B, Stone EA, Rosenbloom KR, Kent WJ, Bouffard GG, Guan X, Hansen NF, Idol JR, Maduro VVB, Maskeri B, McDowell JC, Park M, Thomas PJ, Young AC, Blakesley RW, Muzny DM, Sodergren E, Wheeler D, Worley KC, Jiang H, Weinstock GM, Gibbs RA, Graves T, Fulton RE, Mardis ER, Wilson RK, Clamp M, Cuff J, Gnerre S, Jaffe DB, Chang JL, LindbladToh K, Lander ES, Hinrichs A, Trumbower H, Clawson H, Zweig A, Kuhn RM, Barber G, Harte R, Karolchik D, Field MA, Moore RA, Matthewson CA, Schein JE, Marra MA, Antonarakis SE, Batzoglou S, Goldman N, Hardison R, Haussler D, Miller W, Pachter L, Green ED, Sidow A: Analyses of Deep Mammalian Sequence Alignments and Constraint Predictions for 1% of The Human Genome. Genome Research 2007., 17(6): [] 10.1101/gr.6034307
  37. Thompson JD, Koehl P, Ripp R, Poch O: BAliBASE 3.0: Latest developments of the multiple sequence alignment benchmark. Proteins: Structure, Function, and Bioinformatics 2005, 61: 127–136. 10.1002/prot.20527View ArticleGoogle Scholar
  38. Jareborg N, Birney E, Durbin R: Comparative Analysis of Noncoding Regions of 77 Orthologous Mouse and Human Gene Pairs. Genome Research 1999, 9(9):815–824. [] 10.1101/gr.9.9.815View ArticlePubMedPubMed CentralGoogle Scholar
  39. Kim J, Sinha S: Towards realistic benchmarks for multiple alignments of non-coding sequences. BMC Bioinformatics 2010, 11: 54. [–2105/11/54] 10.1186/1471-2105-11-54View ArticlePubMedPubMed CentralGoogle Scholar
  40. PlasmoDB: PlasmoDB: Plasmodium Genome Resource, Release 6.2.2009. [] [Accessed Nov 2009]Google Scholar
  41. Das A, Sharma M, Gupta B, Dash A: Plasmodium falciparum and Plasmodium vivax: so similar, yet very different. Parasitology Research 2009, 105(4):1169–1171. 10.1007/s00436-009-1521-yView ArticlePubMedGoogle Scholar
  42. Dix TI, Powell D, Allison L, Bernal J, Jaeger S, Stern L: Comparative Analysis of Long DNA Sequences by Per Element Information Content Using Different Contexts. BMC Bioinformatics 2007, 8(Suppl 2):S10. [–2105/8/S2/S10] 10.1186/1471-2105-8-S2-S10View ArticlePubMedPubMed CentralGoogle Scholar
  43. Cao MD, Dix TI, Allison L: A Genome Alignment Algorithm Based on Compression. Tech. Rep. 2009/233, Faculty of Information Technology, Monash University, Victoria, Australia; 2009.Google Scholar
  44. Dayhoff MO, Schwartz RM, Orcutt BC: A Model for Evolutionary Change in Proteins. Volume 5. Washington DC: National Biochemical Research Foundation; 1978.Google Scholar
  45. Henikoff S, Henikoff JG: Amino Acid Substitution Matrices from Protein Blocks. Proceedings of the National Academy of Sciences 1992, 89(22):10915–10919. [] 10.1073/pnas.89.22.10915View ArticleGoogle Scholar
  46. Paila U, Kondam R, Ranjan A: Genome bias influences amino acid choices: analysis of amino acid substitution and re-compilation of substitution matrices exclusive to an AT-biased genome. Nucleic Acids Research 2008, 36(21):6664–6675. [] 10.1093/nar/gkn635View ArticlePubMedPubMed CentralGoogle Scholar
  47. Agrawal A, Huang X: Pairwise statistical significance of local sequence alignment using multiple parameter sets and empirical justification of parameter set change penalty. BMC Bioinformatics 2009, 10(Suppl 3):S1. [–2105/10/S3/S1] 10.1186/1471-2105-10-S3-S1View ArticlePubMedPubMed CentralGoogle Scholar
  48. Yu YK, Altschul SF: The construction of amino acid substitution matrices for the comparison of proteins with non-standard compositions. Bioinformatics 2005, 21(7):902–911. [] 10.1093/bioinformatics/bti070View ArticlePubMedGoogle Scholar
  49. Schäffer AA, Aravind L, Madden TL, Shavirin S, Spouge JL, Wolf YI, Koonin EV, Altschul SF: Improving the accuracy of PSI-BLAST protein database searches with composition-based statistics and other refinements. Nucleic Acids Research 2001, 29(14):2994–3005. [] 10.1093/nar/29.14.2994View ArticlePubMedPubMed CentralGoogle Scholar


© Cao et al; licensee BioMed Central Ltd. 2010

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.