during the last few years , cross - species sequence comparison has become a widely used approach to genome sequence analysis .
the underlying idea is that functional regions of genomic sequences tend to be more conserved during evolution than non - functional parts .
thus , islands of local sequence similarity among two or several genomic sequences usually indicate biological functionality . this phylogenetic footprinting principle has been used by many researchers to detect novel functional elements in genomic sequences .
genomic sequence comparison has been used for gene prediction ( 15 ) , to discover regulatory elements ( 6,7 ) and to study genomic duplications ( 8,9 ) . recently
, multiple sequence comparison has been used to identifiy signature sequences of bacteria and viruses for rapid detection of pathogene microorganisms as part of the us biodefense program ( 10 ) and to detect non - coding functional rna ( 11 ) .
all these studies rely on pair - wise or multiple alignments of genomic sequences ; their accuracy is therefore limited by the accuracy of the underlying alignment tools .
consequently , development of algorithms for genomic sequence alignment has become a high priority in bioinformatics research , see ( 12,13 ) for a survey . a systematic evaluation of the currently used software tools for multiple alignment of genomic sequences has been carried out by pollard et al .
dialign is a general - purpose alignment program that combines global and local alignment features ( 15,16 ) .
such an approach is particularly appropriate when genomic sequences are to be aligned where locally conserved regions may be separated by non - related parts of the sequences . as a stand - alone tool ,
however , dialign is too slow to align long genomic sequences as the program running time grows quadratically with the average sequence length .
, user - specified anchor points can be used to reduce the alignment search space , thereby improving the program running time ( 17 ) . to find suitable anchor points , we use the local alignment program chaos ( 18 ) . in a first step , our system applies chaos to identify chains of local similarities among all pairs of input sequences in a multiple sequence set . in a second step
, dialign is used to accurately align the regions between the similarities identified by chaos .
our anchored - alignment approach can be applied for pair - wise as well as multiple alignment . for multiple alignment
the resulting local pair - wise similarities are then checked for consistency by dialign and non - consistent ones are eliminated .
this procedure is similar to the greedy approach that dialign uses to construct multiple alignments , see ( 16 ) .
abc ( application for browsing constraints ) is an interactive java tool that has recently been developed by cooper et al .
it can be used to move quickly from a summary view of the entire alignment via arbitrary levels of resolution down to the level of individual nucleotides .
abc can graphically represent additional information , such as the degree of local sequence conservation or annotation data , such as the locations of genes , etc .
the degree of local similarity among the input sequences is graphically represented based on the weight scores used by dialign to assess the local degree of similarity among the sequences to be analyzed .
the standard dialign output file represents the degree of local similarity in a pair - wise or multiple alignment , using stars or numbers below the alignment . for each alignment column
, the weight scores of all fragments connecting residues at this column are summed up and normalized , see ( 16 ) for a precise definition of fragment weights .
we use the same measure of local sequence similarity for graphical representation by abc . note
it is possible that columns with identical nucleotide composition receive different similarity values if they are connected by fragments with different weight scores .
it is also important to keep in mind , that our similarity values are not absolute values but are normalized such that in every alignment the column of maximum local similarity obtains a certain fixed score .
nevertheless , our graphical representation gives a good overview of the local degree of conservation among a sequence set .
the input data for our web server is a single text file containing two or several genomic sequences in fasta format .
this requires that the user has java installed on his computer . for small input data , the resulting alignment is immediately shown on the computer screen  either in standard dialign format or using abc if this option has been chosen . for larger sequence sets , the program output is stored at our server ;
different output files are created : ( i ) the output alignment in dialign format , ( ii ) the same alignment in fasta format , ( iii ) a list of fragments , i.e. local segment pairs , that are used as building blocks for the dialign alignment , and ( iv ) a list of anchor points identified by chaos .
in addition the optional abc output is stored at the server together with these standard output files .
alignments in dialign format contain additional information about the degree of local sequence similarity in the multiple alignment .
also , the program distinguishes between nucleotides that could be aligned and nucleotides with no statistically significant matches to the compared sequences . upper - case and lower - case letters
are used to indicate which nucleotides are considered to be aligned . this output format and the abc output
the output in fasta format contains essentially the same information but is more appropriate for further automatic analysis as most sequence analysis programs accept fasta - formatted files as input data .
the list of returned fragments is annotated with some additional information that may be useful for more detailed analyses .
this includes quality scores ( so called weights ) of the fragments indicating the degree of local sequence similarity .
overlap weights reflect not only the similarity between two segments but also the degree of overlap with other segment pairs involving different pairs of sequences as described in ( 15 ) .
finally , the fragment list states for each fragment if it was consistent with other fragments and could be included into the multiple alignment or if it had to be rejected because of non - consistency .
in addition to the fragment list , a list of anchor points created by chaos is returned .
the user can interactively switch between different levels from a global view of the output alignment down to the level of individual residues .
 comparative analysis of genomic sequences is a powerful approach to discover functional sites in these sequences . herein , we present a www - based software system for multiple alignment of genomic sequences . 
 we use the local alignment tool chaos to rapidly identify chains of pairwise similarities . 
 these similarities are used as anchor points to speed up the dialign multiple - alignment program . 
 finally , the visualization tool abc is used for interactive graphical representation of the resulting multiple alignments . 
 our software is available at gttingen bioinformatics compute server ( gobics ) at 
INTRODUCTION
THE CHAOS/DIALIGN APPROACH
ALIGNMENT VISUALIZATION WITH ABC
THE CHAOS/DIALIGN/ABC WWW SERVER
AVAILABILITY
Figures and Tables