Bio SimpleAlign
SummaryIncluded librariesPackage variablesSynopsisDescriptionGeneral documentationMethods
Summary
Bio::SimpleAlign - Multiple alignments held as a set of sequences
Package variables
No package variables defined.
Included modules
Bio::LocatableSeq
Bio::Seq
Bio::SeqFeature::Generic
Inherit
Bio::Align::AlignI Bio::AnnotatableI Bio::Root::Root
Synopsis
  # Use Bio::AlignIO to read in the alignment
$str = Bio::AlignIO->new(-file => 't/data/testaln.pfam');
$aln = $str->next_aln();
# Describe print $aln->length; print $aln->no_residues; print $aln->is_flush; print $aln->no_sequences; print $aln->score; print $aln->percentage_identity; print $aln->consensus_string(50); # Find the position in the alignment for a sequence location $pos = $aln->column_from_residue_number('1433_LYCES', 14); # = 6; # Extract sequences and check values for the alignment column $pos foreach $seq ($aln->each_seq) { $res = $seq->subseq($pos, $pos); $count{$res}++; } foreach $res (keys %count) { printf "Res: %s Count: %2d\n", $res, $count{$res}; } # Manipulate $aln->remove_seq($seq); $mini_aln = $aln->slice(20,30); # get a block of columns $mini_aln = $aln->select_noncont(1,3,5,7,11); # get single columns $new_aln = $aln->remove_columns([20,30]); # remove by position $new_aln = $aln->remove_columns(['mismatch']); # remove by property # Analyze $str = $aln->consensus_string($threshold_percent); $str = $aln->match_line(); $str = $aln->cigar_line() $id = $aln->percentage_identity;
See the module documentation for details and more methods.
Description
SimpleAlign is an object that handles a multiple sequence alignment
(MSA). It is very permissive of types (it does not insist on sequences
being all same length, for example). Think of it as a set of sequences
with a whole series of built-in manipulations and methods for reading and
writing alignments.
SimpleAlign uses Bio::LocatableSeq, a subclass of Bio::PrimarySeq,
to store its sequences. These are subsequences with a start and end
positions in the parent reference sequence. Each sequence in the
SimpleAlign object is a Bio::LocatableSeq.
SimpleAlign expects the combination of name, start, and end for a
given sequence to be unique in the alignment, and this is the key for the
internal hashes (name, start, end are abbreviated nse in the code).
However, in some cases people do not want the name/start-end to be displayed:
either multiple names in an alignment or names specific to the alignment
(ROA1_HUMAN_1, ROA1_HUMAN_2 etc). These names are called
displayname, and generally is what is used to print out the
alignment. They default to name/start-end.
The SimpleAlign Module is derived from the Align module by Ewan Birney.
Methods
BEGIN Code
newDescriptionCode
addSeq
No description
Code
add_seqDescriptionCode
removeSeq
No description
Code
remove_seqDescriptionCode
purgeDescriptionCode
sort_alphabeticallyDescriptionCode
set_new_referenceDescriptionCode
_in_aln
No description
Code
uniq_seqDescriptionCode
_check_uniq
No description
Code
_convert_leading_ending_gaps
No description
Code
eachSeq
No description
Code
each_seqDescriptionCode
each_alphabeticallyDescriptionCode
_alpha_startend
No description
Code
eachSeqWithId
No description
Code
each_seq_with_idDescriptionCode
get_seq_by_posDescriptionCode
seq_with_featuresDescriptionCode
selectDescriptionCode
select_noncontDescriptionCode
sliceDescriptionCode
remove_columnsDescriptionCode
remove_gapsDescriptionCode
_remove_col
No description
Code
_remove_columns_by_type
No description
Code
_remove_columns_by_num
No description
Code
splice_by_seq_posDescriptionCode
map_charsDescriptionCode
uppercaseDescriptionCode
cigar_lineDescriptionCode
match_lineDescriptionCode
gap_lineDescriptionCode
all_gap_lineDescriptionCode
gap_col_matrixDescriptionCode
matchDescriptionCode
unmatchDescriptionCode
idDescriptionCode
accessionDescriptionCode
descriptionDescriptionCode
missing_charDescriptionCode
match_charDescriptionCode
gap_charDescriptionCode
symbol_charsDescriptionCode
scoreDescriptionCode
consensus_stringDescriptionCode
_consensus_aa
No description
Code
consensus_iupacDescriptionCode
_consensus_iupac
No description
Code
consensus_metaDescriptionCode
is_flushDescriptionCode
length_aln
No description
Code
lengthDescriptionCode
maxname_length
No description
Code
maxnse_length
No description
Code
maxdisplayname_lengthDescriptionCode
max_metaname_lengthDescriptionCode
no_residuesDescriptionCode
no_sequencesDescriptionCode
average_percentage_identityDescriptionCode
percentage_identityDescriptionCode
overall_percentage_identityDescriptionCode
column_from_residue_numberDescriptionCode
get_displayname
No description
Code
set_displayname
No description
Code
displaynameDescriptionCode
set_displayname_countDescriptionCode
set_displayname_flatDescriptionCode
set_displayname_normalDescriptionCode
sourceDescriptionCode
annotationDescriptionCode
Methods description
newcode    nextTop
 Title     : new
Usage : my $aln = new Bio::SimpleAlign();
Function : Creates a new simple align object
Returns : Bio::SimpleAlign
Args : -source => string representing the source program
where this alignment came from
add_seqcodeprevnextTop
 Title     : add_seq
Usage : $myalign->add_seq($newseq);
Function : Adds another sequence to the alignment. *Does not* align
it - just adds it to the hashes.
Returns : nothing
Args : a Bio::LocatableSeq object
order (optional)
See Bio::LocatableSeq for more information
remove_seqcodeprevnextTop
 Title     : remove_seq
Usage : $aln->remove_seq($seq);
Function : Removes a single sequence from an alignment
Returns :
Argument : a Bio::LocatableSeq object
purgecodeprevnextTop
 Title   : purge
Usage : $aln->purge(0.7);
Function: Removes sequences above given sequence similarity
This function will grind on large alignments. Beware!
Example :
Returns : An array of the removed sequences
Args : float, threshold for similarity
sort_alphabeticallycodeprevnextTop
 Title     : sort_alphabetically
Usage : $ali->sort_alphabetically
Function : Changes the order of the alignemnt to alphabetical on name
followed by numerical by number.
Returns :
Argument :
set_new_referencecodeprevnextTop
 Title     : set_new_reference
Usage : $aln->set_new_reference(3 or 'B31'): Select the 3rd sequence, or
the sequence whoes name is "B31" (full, exact, and case-sensitive),
as the reference (1st) sequence
Function : Change/Set a new reference (i.e., the first) sequence
Returns : a new Bio::SimpleAlign object.
Throws an exception if designated sequence not found
Argument : a positive integer of sequence order, or a sequence name
in the original alignment
uniq_seqcodeprevnextTop
 Title     : uniq_seq
Usage : $aln->uniq_seq(): Remove identical sequences in
in the alignment. Ambiguous base ("N", "n") and
leading and ending gaps ("-") are NOT counted as
differences.
Function : Make a new alignment of unique sequence types (STs)
Returns : 1. a new Bio::SimpleAlign object (all sequences renamed as "ST")
2. ST of each sequence in STDERR
Argument : None
each_seqcodeprevnextTop
 Title     : each_seq
Usage : foreach $seq ( $align->each_seq() )
Function : Gets a Seq object from the alignment
Returns : Seq object
Argument :
each_alphabeticallycodeprevnextTop
 Title     : each_alphabetically
Usage : foreach $seq ( $ali->each_alphabetically() )
Function : Returns a sequence object, but the objects are returned
in alphabetically sorted order.
Does not change the order of the alignment.
Returns : Seq object
Argument :
each_seq_with_idcodeprevnextTop
 Title     : each_seq_with_id
Usage : foreach $seq ( $align->each_seq_with_id() )
Function : Gets a Seq objects from the alignment, the contents
being those sequences with the given name (there may be
more than one)
Returns : Seq object
Argument : a seq name
get_seq_by_poscodeprevnextTop
 Title     : get_seq_by_pos
Usage : $seq = $aln->get_seq_by_pos(3) # third sequence from the alignment
Function : Gets a sequence based on its position in the alignment.
Numbering starts from 1. Sequence positions larger than
no_sequences() will thow an error.
Returns : a Bio::LocatableSeq object
Args : positive integer for the sequence osition
seq_with_featurescodeprevnextTop
 Title   : seq_with_features
Usage : $seq = $aln->seq_with_features(-pos => 1,
-consensus => 60
-mask =>
sub { my $consensus = shift;
for my $i (1..5){ my $n = 'N' x $i; my $q = '\?' x $i; while($consensus =~ /[^?]$q[^?]/){ $consensus =~ s/([^?])$q([^?])/$1$n$2/; } } return $consensus; } ); Function: produces a Bio::Seq object by first splicing gaps from -pos (by means of a splice_by_seq_pos() call), then creating features using non-? chars (by means of a consensus_string() call with stringency -consensus). Returns : a Bio::Seq object Args : -pos : required. sequence from which to build the Bio::Seq object -consensus : optional, defaults to consensus_string()'s default cutoff value -mask : optional, a coderef to apply to consensus_string()'s output before building features. this may be useful for closing gaps of 1 bp by masking over them with N, for instance
selectcodeprevnextTop
 Title     : select
Usage : $aln2 = $aln->select(1, 3) # three first sequences
Function : Creates a new alignment from a continuous subset of
sequences. Numbering starts from 1. Sequence positions
larger than no_sequences() will thow an error.
Returns : a Bio::SimpleAlign object
Args : positive integer for the first sequence
positive integer for the last sequence to include (optional)
select_noncontcodeprevnextTop
 Title     : select_noncont
Usage : $aln2 = $aln->select_noncont(1, 3) # 1st and 3rd sequences
Function : Creates a new alignment from a subset of
sequences. Numbering starts from 1. Sequence positions
larger than no_sequences() will thow an error.
Returns : a Bio::SimpleAlign object
Args : array of integers for the sequences
slicecodeprevnextTop
 Title     : slice
Usage : $aln2 = $aln->slice(20,30)
Function : Creates a slice from the alignment inclusive of start and
end columns, and the first column in the alignment is denoted 1.
Sequences with no residues in the slice are excluded from the
new alignment and a warning is printed. Slice beyond the length of
the sequence does not do padding.
Returns : A Bio::SimpleAlign object
Args : Positive integer for start column, positive integer for end column,
optional boolean which if true will keep gap-only columns in the newly
created slice. Example:
$aln2 = $aln->slice(20,30,1)
remove_columnscodeprevnextTop
 Title     : remove_columns
Usage : $aln2 = $aln->remove_columns(['mismatch','weak']) or
$aln2 = $aln->remove_columns([0,0],[6,8])
Function : Creates an aligment with columns removed corresponding to
the specified type or by specifying the columns by number.
Returns : Bio::SimpleAlign object
Args : Array ref of types ('match'|'weak'|'strong'|'mismatch'|'gaps'|
'all_gaps_columns') or array ref where the referenced array
contains a pair of integers that specify a range.
The first column is 0,
remove_gapscodeprevnextTop
 Title     : remove_gaps
Usage : $aln2 = $aln->remove_gaps
Function : Creates an aligment with gaps removed
Returns : a Bio::SimpleAlign object
Args : a gap character(optional) if none specified taken
from $self->gap_char,
[optional] $all_gaps_columns flag (1 or 0, default is 0)
indicates that only all-gaps columns should be deleted
Used from method remove_columns in most cases. Set gap character
using gap_char().
splice_by_seq_poscodeprevnextTop
 Title   : splice_by_seq_pos
Usage : $status = splice_by_seq_pos(1);
Function: splices all aligned sequences where the specified sequence
has gaps.
Example :
Returns : 1 on success
Args : position of sequence to splice by
map_charscodeprevnextTop
 Title     : map_chars
Usage : $ali->map_chars('\.','-')
Function : Does a s/$arg1/$arg2/ on the sequences. Useful for gap
characters
Notice that the from (arg1) is interpretted as a regex, so be careful about quoting meta characters (eg $ali->map_chars('.','-') wont do what you want) Returns : Argument : 'from' rexexp 'to' string
uppercasecodeprevnextTop
 Title     : uppercase()
Usage : $ali->uppercase()
Function : Sets all the sequences to uppercase
Returns :
Argument :
cigar_linecodeprevnextTop
 Title    : cigar_line()
Usage : %cigars = $align->cigar_line()
Function : Generates a "cigar" (Compact Idiosyncratic Gapped Alignment
Report) line for each sequence in the alignment. Examples are
"1,60" or "5,10:12,58", where the numbers refer to conserved
positions within the alignment. The keys of the hash are the
NSEs (name/start/end) assigned to each sequence.
Args : none
Returns : Hash of strings (cigar lines)
match_linecodeprevnextTop
 Title    : match_line()
Usage : $line = $align->match_line()
Function : Generates a match line - much like consensus string
except that a line indicating the '*' for a match.
Args : (optional) Match line characters ('*' by default)
(optional) Strong match char (':' by default)
(optional) Weak match char ('.' by default)
Returns : String
gap_linecodeprevnextTop
 Title    : gap_line()
Usage : $line = $align->gap_line()
Function : Generates a gap line - much like consensus string
except that a line where '-' represents gap
Args : (optional) gap line characters ('-' by default)
Returns : string
all_gap_linecodeprevnextTop
 Title    : all_gap_line()
Usage : $line = $align->all_gap_line()
Function : Generates a gap line - much like consensus string
except that a line where '-' represents all-gap column
Args : (optional) gap line characters ('-' by default)
Returns : string
gap_col_matrixcodeprevnextTop
 Title    : gap_col_matrix()
Usage : my $cols = $align->gap_col_matrix()
Function : Generates an array of hashes where
each entry in the array is a hash reference
with keys of all the sequence names and
and value of 1 or 0 if the sequence has a gap at that column
Args : (optional) gap line characters ($aln->gap_char or '-' by default)
matchcodeprevnextTop
 Title     : match()
Usage : $ali->match()
Function : Goes through all columns and changes residues that are
identical to residue in first sequence to match '.'
character. Sets match_char.
USE WITH CARE: Most MSA formats do not support match characters in sequences, so this is mostly for output only. NEXUS format (Bio::AlignIO::nexus) can handle it. Returns : 1 Argument : a match character, optional, defaults to '.'
unmatchcodeprevnextTop
 Title     : unmatch()
Usage : $ali->unmatch()
Function : Undoes the effect of method match. Unsets match_char.
Returns : 1
Argument : a match character, optional, defaults to '.'
See match and match_char
idcodeprevnextTop
 Title     : id
Usage : $myalign->id("Ig")
Function : Gets/sets the id field of the alignment
Returns : An id string
Argument : An id string (optional)
accessioncodeprevnextTop
 Title     : accession
Usage : $myalign->accession("PF00244")
Function : Gets/sets the accession field of the alignment
Returns : An acc string
Argument : An acc string (optional)
descriptioncodeprevnextTop
 Title     : description
Usage : $myalign->description("14-3-3 proteins")
Function : Gets/sets the description field of the alignment
Returns : An description string
Argument : An description string (optional)
missing_charcodeprevnextTop
 Title     : missing_char
Usage : $myalign->missing_char("?")
Function : Gets/sets the missing_char attribute of the alignment
It is generally recommended to set it to 'n' or 'N'
for nucleotides and to 'X' for protein.
Returns : An missing_char string,
Argument : An missing_char string (optional)
match_charcodeprevnextTop
 Title     : match_char
Usage : $myalign->match_char('.')
Function : Gets/sets the match_char attribute of the alignment
Returns : An match_char string,
Argument : An match_char string (optional)
gap_charcodeprevnextTop
 Title     : gap_char
Usage : $myalign->gap_char('-')
Function : Gets/sets the gap_char attribute of the alignment
Returns : An gap_char string, defaults to '-'
Argument : An gap_char string (optional)
symbol_charscodeprevnextTop
 Title   : symbol_chars
Usage : my @symbolchars = $aln->symbol_chars;
Function: Returns all the seen symbols (other than gaps)
Returns : array of characters that are the seen symbols
Args : boolean to include the gap/missing/match characters
scorecodeprevnextTop
 Title     : score
Usage : $str = $ali->score()
Function : get/set a score of the alignment
Returns : a score for the alignment
Argument : an optional score to set
consensus_stringcodeprevnextTop
 Title     : consensus_string
Usage : $str = $ali->consensus_string($threshold_percent)
Function : Makes a strict consensus
Returns : Consensus string
Argument : Optional treshold ranging from 0 to 100.
The consensus residue has to appear at least threshold %
of the sequences at a given location, otherwise a '?'
character will be placed at that location.
(Default value = 0%)
consensus_iupaccodeprevnextTop
 Title     : consensus_iupac
Usage : $str = $ali->consensus_iupac()
Function : Makes a consensus using IUPAC ambiguity codes from DNA
and RNA. The output is in upper case except when gaps in
a column force output to be in lower case.
Note that if your alignment sequences contain a lot of IUPAC ambiquity codes you often have to manually set alphabet. Bio::PrimarySeq::_guess_type thinks they indicate a protein sequence. Returns : consensus string Argument : none Throws : on protein sequences
consensus_metacodeprevnextTop
 Title     : consensus_meta
Usage : $seqmeta = $ali->consensus_meta()
Function : Returns a Bio::Seq::Meta object containing the consensus
strings derived from meta data analysis.
Returns : Bio::Seq::Meta
Argument : Bio::Seq::Meta
Throws : non-MetaI object
is_flushcodeprevnextTop
 Title     : is_flush
Usage : if ( $ali->is_flush() )
Function : Tells you whether the alignment
: is flush, i.e. all of the same length
Returns : 1 or 0
Argument :
lengthcodeprevnextTop
 Title     : length()
Usage : $len = $ali->length()
Function : Returns the maximum length of the alignment.
To be sure the alignment is a block, use is_flush
Returns : Integer
Argument :
maxdisplayname_lengthcodeprevnextTop
 Title     : maxdisplayname_length
Usage : $ali->maxdisplayname_length()
Function : Gets the maximum length of the displayname in the
alignment. Used in writing out various MSA formats.
Returns : integer
Argument :
max_metaname_lengthcodeprevnextTop
 Title     : max_metaname_length
Usage : $ali->max_metaname_length()
Function : Gets the maximum length of the meta name tags in the
alignment for the sequences and for the alignment.
Used in writing out various MSA formats.
Returns : integer
Argument : None
no_residuescodeprevnextTop
 Title     : no_residues
Usage : $no = $ali->no_residues
Function : number of residues in total in the alignment
Returns : integer
Argument :
no_sequencescodeprevnextTop
 Title     : no_sequences
Usage : $depth = $ali->no_sequences
Function : number of sequence in the sequence alignment
Returns : integer
Argument :
average_percentage_identitycodeprevnextTop
 Title   : average_percentage_identity
Usage : $id = $align->average_percentage_identity
Function: The function uses a fast method to calculate the average
percentage identity of the alignment
Returns : The average percentage identity of the alignment
Args : None
Notes : This method implemented by Kevin Howe calculates a figure that is
designed to be similar to the average pairwise identity of the
alignment (identical in the absence of gaps), without having to
explicitly calculate pairwise identities proposed by Richard Durbin.
Validated by Ewan Birney ad Alex Bateman.
percentage_identitycodeprevnextTop
 Title   : percentage_identity
Usage : $id = $align->percentage_identity
Function: The function calculates the average percentage identity
(aliased to average_percentage_identity)
Returns : The average percentage identity
Args : None
overall_percentage_identitycodeprevnextTop
 Title   : percentage_identity
Usage : $id = $align->percentage_identity
Function: The function calculates the percentage identity of
the conserved columns
Returns : The percentage identity of the conserved columns
Args : None
column_from_residue_numbercodeprevnextTop
 Title   : column_from_residue_number
Usage : $col = $ali->column_from_residue_number( $seqname, $resnumber)
Function: This function gives the position in the alignment
(i.e. column number) of the given residue number in the
sequence with the given name. For example, for the
alignment
Seq1/91-97 AC..DEF.GH. Seq2/24-30 ACGG.RTY... Seq3/43-51 AC.DDEF.GHI column_from_residue_number( "Seq1", 94 ) returns 6. column_from_residue_number( "Seq2", 25 ) returns 2. column_from_residue_number( "Seq3", 50 ) returns 10. An exception is thrown if the residue number would lie outside the length of the aligment (e.g. column_from_residue_number( "Seq2", 22 ) Note: If the the parent sequence is represented by more than one alignment sequence and the residue number is present in them, this method finds only the first one. Returns : A column number for the position in the alignment of the given residue in the given sequence (1 = first column) Args : A sequence id/name (not a name/start-end) A residue number in the whole sequence (not just that segment of it in the alignment)
displaynamecodeprevnextTop
 Title     : displayname
Usage : $myalign->displayname("Ig", "IgA")
Function : Gets/sets the display name of a sequence in the alignment
Returns : A display name string
Argument : name of the sequence
displayname of the sequence (optional)
set_displayname_countcodeprevnextTop
 Title     : set_displayname_count
Usage : $ali->set_displayname_count
Function : Sets the names to be name_# where # is the number of
times this name has been used.
Returns : 1, on success
Argument :
set_displayname_flatcodeprevnextTop
 Title     : set_displayname_flat
Usage : $ali->set_displayname_flat()
Function : Makes all the sequences be displayed as just their name,
not name/start-end
Returns : 1
Argument :
set_displayname_normalcodeprevnextTop
 Title     : set_displayname_normal
Usage : $ali->set_displayname_normal()
Function : Makes all the sequences be displayed as name/start-end
Returns : 1, on success
Argument :
sourcecodeprevnextTop
 Title   : source
Usage : $obj->source($newval)
Function: sets the Alignment source program
Example :
Returns : value of source
Args : newvalue (optional)
annotationcodeprevnextTop
 Title   : annotation
Usage : $ann = $aln->annotation or
$aln->annotation($ann)
Function: Gets or sets the annotation
Returns : Bio::AnnotationCollectionI object
Args : None or Bio::AnnotationCollectionI object
See Bio::AnnotationCollectionI and Bio::Annotation::Collection
for more information
Methods code
BEGINTop
BEGIN {
    # This data should probably be in a more centralized module...
# it is taken from Clustalw documentation.
# These are all the positively scoring groups that occur in the
# Gonnet Pam250 matrix. The strong and weak groups are
# defined as strong score >0.5 and weak score =<0.5 respectively.
%CONSERVATION_GROUPS = ( 'strong' => [ qw( STA NEQK NHQK NDEQ QHRK MILV MILF HY FYW )], 'weak' => [ qw( CSA ATV SAG STNK STPA SGND SNDEQK NDEQHK NEQHRK FVLIM HFY )],);
}
newdescriptionprevnextTop
sub new {
  my($class,@args) = @_;

  my $self = $class->SUPER::new(@args);

  my ($src,$score) = $self->_rearrange([qw(SOURCE SCORE)], @args);
  $src && $self->source($src);
  defined $score && $self->score($score);
  # we need to set up internal hashs first!
$self->{'_seq'} = {}; $self->{'_order'} = {}; $self->{'_start_end_lists'} = {}; $self->{'_dis_name'} = {}; $self->{'_id'} = 'NoName'; $self->{'_symbols'} = {}; # maybe we should automatically read in from args. Hmmm...
return $self; # success - we hope!
}
addSeqdescriptionprevnextTop
sub addSeq {
    my $self = shift;
    $self->deprecated("addSeq - deprecated method. Use add_seq() instead.");
    $self->add_seq(@_);
}
add_seqdescriptionprevnextTop
sub add_seq {
    my $self = shift;
    my $seq  = shift;
    my $order = shift;
    my ($name,$id,$start,$end);

    if( ! ref $seq || ! $seq->isa('Bio::LocatableSeq') ) {
	$self->throw("Unable to process non locatable sequences [". ref($seq). "]");
    }

    $id = $seq->id() ||$seq->display_id || $seq->primary_id;
    $start = $seq->start();
    $end  = $seq->end();

    # build the symbol list for this sequence,
# will prune out the gap and missing/match chars
# when actually asked for the symbol list in the
# symbol_chars
map { $self->{'_symbols'}->{$_} = 1; } split(//,$seq->seq) if $seq->seq; if( !defined $order ) { $order = keys %{$self->{'_seq'}}; } $name = sprintf("%s/%d-%d",$id,$start,$end); if( $self->{'_seq'}->{$name} ) { $self->warn("Replacing one sequence [$name]\n") unless $self->verbose < 0; } else { $self->debug( "Assigning $name to $order\n"); $self->{'_order'}->{$order} = $name; unless( exists( $self->{'_start_end_lists'}->{$id})) { $self->{'_start_end_lists'}->{$id} = []; } push @{$self->{'_start_end_lists'}->{$id}}, $seq; } $self->{'_seq'}->{$name} = $seq;
}
removeSeqdescriptionprevnextTop
sub removeSeq {
    my $self = shift;
    $self->deprecated("removeSeq - deprecated method. Use remove_seq() instead.");
    $self->remove_seq(@_);
}
remove_seqdescriptionprevnextTop
sub remove_seq {
    my $self = shift;
    my $seq = shift;
    my ($name,$id,$start,$end);

    $self->throw("Need Bio::Locatable seq argument ")
	unless ref $seq && $seq->isa( 'Bio::LocatableSeq');

    $id = $seq->id();
    $start = $seq->start();
    $end  = $seq->end();
    $name = sprintf("%s/%d-%d",$id,$start,$end);

    if( !exists $self->{'_seq'}->{$name} ) {
	$self->throw("Sequence $name does not exist in the alignment to remove!");
    }

    delete $self->{'_seq'}->{$name};

    # we need to remove this seq from the start_end_lists hash
if (exists $self->{'_start_end_lists'}->{$id}) { # we need to find the sequence in the array.
my ($i, $found);; for ($i=0; $i < @{$self->{'_start_end_lists'}->{$id}}; $i++) { if (${$self->{'_start_end_lists'}->{$id}}[$i] eq $seq) { $found = 1; last; } } if ($found) { splice @{$self->{'_start_end_lists'}->{$id}}, $i, 1; } else { $self->throw("Could not find the sequence to remoce from the start-end list"); } } else { $self->throw("There is no seq list for the name $id"); } # we need to shift order hash
my %rev_order = reverse %{$self->{'_order'}}; my $no = $rev_order{$name}; my $no_sequences = $self->no_sequences; for (; $no < $no_sequences; $no++) { $self->{'_order'}->{$no} = $self->{'_order'}->{$no+1}; } delete $self->{'_order'}->{$no}; return 1;
}
purgedescriptionprevnextTop
sub purge {
	my ($self,$perc) = @_;
	my (%duplicate, @dups);

	my @seqs = $self->each_seq();

	for (my $i=0;$i< @seqs - 1;$i++ ) { #for each seq in alignment
my $seq = $seqs[$i]; #skip if already in duplicate hash
next if exists $duplicate{$seq->display_id} ; my $one = $seq->seq(); my @one = split '', $one; #split to get 1aa per array element
for (my $j=$i+1;$j < @seqs;$j++) { my $seq2 = $seqs[$j]; #skip if already in duplicate hash
next if exists $duplicate{$seq2->display_id} ; my $two = $seq2->seq(); my @two = split '', $two; my $count = 0; my $res = 0; for (my $k=0;$k<@one;$k++) { if ( $one[$k] ne '.' && $one[$k] ne '-' && defined($two[$k]) && $one[$k] eq $two[$k]) { $count++; } if ( $one[$k] ne '.' && $one[$k] ne '-' && defined($two[$k]) && $two[$k] ne '.' && $two[$k] ne '-' ) { $res++; } } my $ratio = 0; $ratio = $count/$res unless $res == 0;
# if above threshold put in duplicate hash and push onto
# duplicate array for returning to get_unique
if ( $ratio > $perc ) { $self->warn("duplicate: ", $seq2->display_id) if $self->verbose > 0; $duplicate{$seq2->display_id} = 1; push @dups, $seq2; } } } foreach my $seq (@dups) { $self->remove_seq($seq); } return @dups;
}
sort_alphabeticallydescriptionprevnextTop
sub sort_alphabetically {
    my $self = shift;
    my ($seq,$nse,@arr,%hash,$count);

    foreach $seq ( $self->each_seq() ) {
	$nse = $seq->get_nse;
	$hash{$nse} = $seq;
    }

    $count = 0;

    %{$self->{'_order'}} = (); # reset the hash;
foreach $nse ( sort _alpha_startend keys %hash) { $self->{'_order'}->{$count} = $nse; $count++; } 1;
}
set_new_referencedescriptionprevnextTop
sub set_new_reference {
    my ($self, $seqid) = @_;
    my $aln = $self->new;
    my (@seq, @ids, @new_seq);
    my $is_num=0;
    foreach my $seq ( $self->each_seq() ) {
	push @seq, $seq;
	push @ids, $seq->display_id;
    }

    if ($seqid =~ /^\d+$/) { # argument is seq position
$is_num=1; $self->throw("The new reference sequence number has to be a positive integer >1 and <= no_sequences ") if ($seqid <= 1 || $seqid > $self->no_sequences); } else { # argument is a seq name
$self->throw("The new reference sequence not in alignment ") unless &_in_aln($seqid,\@ ids); } for (my $i=0; $i<=$#seq; $i++) { my $pos=$i+1; if ( ($is_num && $pos == $seqid) || ($seqid eq $seq[$i]->display_id) ) { unshift @new_seq, $seq[$i]; } else { push @new_seq, $seq[$i]; } } foreach (@new_seq) { $aln->add_seq($_); } return $aln;
}
_in_alndescriptionprevnextTop
sub _in_aln {
  # check if input name exists in the alignment    my ($str, $ref) = @_;
foreach (@$ref) { return 1 if $str eq $_; } return 0;
}
uniq_seqdescriptionprevnextTop
sub uniq_seq {
    my ($self, $seqid) = @_;
    my $aln = $self->new;
    my (%member, %order, @seq, @uniq_str);
    my $order=0;
    my $len = $self->length();
    foreach my $seq ( $self->each_seq() ) {
	my $str = $seq->seq();

# it's necessary to ignore "n", "N", leading gaps and ending gaps in
# comparing two sequence strings
# 1st, convert "n", "N" to "?" (for DNA sequence only):
$str =~ s/n/\?/gi if $str =~ /^[atcgn-]+$/i; # 2nd, convert leading and ending gaps to "?":
$str = &_convert_leading_ending_gaps($str, '-', '?'); my $new = new Bio::LocatableSeq(-id=>$seq->id(), -seq=>$str, -start=>1, -end=>$len); push @seq, $new; } foreach my $seq (@seq) { my $str = $seq->seq(); my ($seen, $key) = &_check_uniq($str,\@ uniq_str, $len); if ($seen) { # seen before
my @memb = @{$member{$key}}; push @memb, $seq; $member{$key} =\@ memb; } else { # not seen
push @uniq_str, $key; $order++; $member{$key} = [ ($seq) ]; $order{$key} = $order; } } foreach my $str (sort {$order{$a} <=> $order{$b}} keys %order) { # sort by input order
# convert leading/ending "?" back into "-" ("?" throws errors by SimpleAlign):
my $str2 = &_convert_leading_ending_gaps($str, '?', '-'); # convert middle "?" back into "N" ("?" throws errors by SimpleAlign):
$str2 =~ s/\?/N/g if $str2 =~ /^[atcg\-\?]+$/i; my $new = new Bio::LocatableSeq(-id=>"ST".$order{$str}, -seq=>$str2, -start=>1, -end=>length($str)); $aln->add_seq($new); # print STDERR "ST".$order{$str}, "\t=>";
foreach (@{$member{$str}}) { $self->debug($_->id(), "\t", "ST", $order{$str}, "\n"); } # print STDERR "\n";
} return $aln;
}
_check_uniqdescriptionprevnextTop
sub _check_uniq {
  # check if same seq exists in the alignment    my ($str1, $ref, $length) = @_;
my @char1=split //, $str1; my @array=@$ref; return (0, $str1) if @array==0; # not seen (1st sequence)
foreach my $str2 (@array) { my $diff=0; my @char2=split //, $str2; for (my $i=0; $i<=$length-1; $i++) { next if $char1[$i] eq '?'; next if $char2[$i] eq '?'; $diff++ if $char1[$i] ne $char2[$i]; } return (1, $str2) if $diff == 0; # seen before
} return (0, $str1); # not seen
}
_convert_leading_ending_gapsdescriptionprevnextTop
sub _convert_leading_ending_gaps {
    my $s=shift;
    my $sym1=shift;
    my $sym2=shift;
    my @array=split //, $s;
# convert leading char:
for (my $i=0; $i<=$#array; $i++) { ($array[$i] eq $sym1) ? ($array[$i] = $sym2):(last); } # convert ending char:
for (my $i = $#array; $i>= 0; $i--) { ($array[$i] eq $sym1) ? ($array[$i] = $sym2):(last); } my $s_new=join '', @array; return $s_new;
}
eachSeqdescriptionprevnextTop
sub eachSeq {
    my $self = shift;
    $self->deprecated("eachSeq - deprecated method. Use each_seq() instead.");
    $self->each_seq();
}
each_seqdescriptionprevnextTop
sub each_seq {
	my $self = shift;
	my (@arr,$order);

	foreach $order ( sort { $a <=> $b } keys %{$self->{'_order'}} ) {
		if( exists $self->{'_seq'}->{$self->{'_order'}->{$order}} ) {
			push(@arr,$self->{'_seq'}->{$self->{'_order'}->{$order}});
		}
	}
	return @arr;
}
each_alphabeticallydescriptionprevnextTop
sub each_alphabetically {
	my $self = shift;
	my ($seq,$nse,@arr,%hash,$count);

	foreach $seq ( $self->each_seq() ) {
		$nse = $seq->get_nse;
		$hash{$nse} = $seq;
	}

	foreach $nse ( sort _alpha_startend keys %hash) {
		push(@arr,$hash{$nse});
	}
	return @arr;
}
_alpha_startenddescriptionprevnextTop
sub _alpha_startend {
    my ($aname,$astart,$bname,$bstart);
    ($aname,$astart) = split (/-/,$a);
    ($bname,$bstart) = split (/-/,$b);

    if( $aname eq $bname ) {
	return $astart <=> $bstart;
    }
    else {
	return $aname cmp $bname;
    }
}
eachSeqWithIddescriptionprevnextTop
sub eachSeqWithId {
    my $self = shift;
    $self->deprecated("eachSeqWithId - deprecated method. Use each_seq_with_id() instead.");
    $self->each_seq_with_id(@_);
}
each_seq_with_iddescriptionprevnextTop
sub each_seq_with_id {
    my $self = shift;
    my $id = shift;

    $self->throw("Method each_seq_with_id needs a sequence name argument")
	unless defined $id;

    my (@arr, $seq);

    if (exists($self->{'_start_end_lists'}->{$id})) {
	@arr = @{$self->{'_start_end_lists'}->{$id}};
    }
    return @arr;
}
get_seq_by_posdescriptionprevnextTop
sub get_seq_by_pos {
    my $self = shift;
    my ($pos) = @_;

    $self->throw("Sequence position has to be a positive integer, not [$pos]")
	unless $pos =~ /^\d+$/ and $pos > 0;
    $self->throw("No sequence at position [$pos]")
	unless $pos <= $self->no_sequences ;

    my $nse = $self->{'_order'}->{--$pos};
    return $self->{'_seq'}->{$nse};
}
seq_with_featuresdescriptionprevnextTop
sub seq_with_features {
   my ($self,%arg) = @_;

   #first do the preparatory splice
$self->throw("must provide a -pos argument") unless $arg{-pos}; $self->splice_by_seq_pos($arg{-pos}); my $consensus_string = $self->consensus_string($arg{-consensus}); $consensus_string = $arg{-mask}->($consensus_string) if defined($arg{-mask}); my(@bs,@es); push @bs, 1 if $consensus_string =~ /^[^?]/; while($consensus_string =~ /\?[^?]/g){ push @bs, pos($consensus_string); } while($consensus_string =~ /[^?]\?/g){ push @es, pos($consensus_string); } push @es, length($consensus_string) if $consensus_string =~ /[^?]$/; my $seq = Bio::Seq->new(); # my $rootfeature = Bio::SeqFeature::Generic->new(
# -source_tag => 'location',
# -start => $self->get_seq_by_pos($arg{-pos})->start,
# -end => $self->get_seq_by_pos($arg{-pos})->end,
# );
# $seq->add_SeqFeature($rootfeature);
while(my $b = shift @bs){ my $e = shift @es; $seq->add_SeqFeature( Bio::SeqFeature::Generic->new( -start => $b - 1 + $self->get_seq_by_pos($arg{-pos})->start, -end => $e - 1 + $self->get_seq_by_pos($arg{-pos})->start, -source_tag => $self->source || 'MSA', ) ); } return $seq;
}
selectdescriptionprevnextTop
sub select {
    my $self = shift;
    my ($start, $end) = @_;

    $self->throw("Select start has to be a positive integer, not [$start]")
	unless $start =~ /^\d+$/ and $start > 0;
    $self->throw("Select end has to be a positive integer, not [$end]")
	unless $end  =~ /^\d+$/ and $end > 0;
    $self->throw("Select $start [$start] has to be smaller than or equal to end [$end]")
	unless $start <= $end;

    my $aln = $self->new;
    foreach my $pos ($start .. $end) {
	$aln->add_seq($self->get_seq_by_pos($pos));
    }
    $aln->id($self->id);
    return $aln;
}
select_noncontdescriptionprevnextTop
sub select_noncont {
	my $self = shift;
	my (@pos) = @_;
	my $end = $self->no_sequences;
	@pos = sort @pos;
	foreach ( @pos ) {
		$self->throw("position must be a positive integer, > 0 and <= $end not [$_]")
		  unless( /^\d+$/ && $_ > 0 && $_ <= $end );
	}
	my $aln = $self->new;
	foreach my $p (@pos) {
		$aln->add_seq($self->get_seq_by_pos($p));
	}
	$aln->id($self->id);
	return $aln;
}
slicedescriptionprevnextTop
sub slice {
	my $self = shift;
	my ($start, $end, $keep_gap_only) = @_;

	$self->throw("Slice start has to be a positive integer, not [$start]")
	  unless $start =~ /^\d+$/ and $start > 0;
	$self->throw("Slice end has to be a positive integer, not [$end]")
	  unless $end =~ /^\d+$/ and $end > 0;
	$self->throw("Slice $start [$start] has to be smaller than or equal to end [$end]")
	  unless $start <= $end;
	$self->throw("This alignment has only ". $self->length . " residues. Slice start " .
					 "[$start] is too big.") if $start > $self->length;

	my $aln = $self->new;
	$aln->id($self->id);
	foreach my $seq ( $self->each_seq() ) {
		my $new_seq = Bio::LocatableSeq->new(-id      => $seq->id,
														 -strand  => $seq->strand,
														 -verbose => $self->verbose);
		# seq
my $seq_end = $end; $seq_end = $seq->length if( $end > $seq->length ); my $slice_seq = $seq->subseq($start, $seq_end); $new_seq->seq( $slice_seq ); $slice_seq =~ s/\W//g; if ($start > 1) { my $pre_start_seq = $seq->subseq(1, $start - 1); $pre_start_seq =~ s/\W//g; if (!defined($seq->strand)) { $new_seq->start( $seq->start + CORE::length($pre_start_seq) ); } elsif ($seq->strand < 0){ $new_seq->start( $seq->end - CORE::length($pre_start_seq) - CORE::length($slice_seq) + 1); } else { $new_seq->start( $seq->start + CORE::length($pre_start_seq) ); } } else { $new_seq->start( $seq->start); } $new_seq->end( $new_seq->start + CORE::length($slice_seq) - 1 ); if ($new_seq->start and $new_seq->end >= $new_seq->start) { $aln->add_seq($new_seq); } else { if( $keep_gap_only ) { $aln->add_seq($new_seq); } else { my $nse = $seq->get_nse(); $self->warn("Slice [$start-$end] of sequence [$nse] contains no residues.". " Sequence excluded from the new alignment."); } } } return $aln;
}
remove_columnsdescriptionprevnextTop
sub remove_columns {
	my ($self,@args) = @_;
	@args || return $self;
   my $aln;

	if ($args[0][0] =~ /^[a-z]+$/i) {
		 $aln = $self->_remove_columns_by_type($args[0]);
	} elsif ($args[0][0] =~ /^\d+$/) {
       $aln = $self->_remove_columns_by_num(\@args);
	} else {
		 $self->throw("You must pass array references to remove_columns(), not @args");
	}
   $aln;
}
remove_gapsdescriptionprevnextTop
sub remove_gaps {
    my ($self,$gapchar,$all_gaps_columns) = @_;
    my $gap_line;
    if ($all_gaps_columns) {
        $gap_line = $self->all_gap_line($gapchar);
    } else {
        $gap_line = $self->gap_line($gapchar);
    }
    my $aln = $self->new;

    my @remove;
    my $length = 0;
    my $del_char = $gapchar || $self->gap_char;
    # Do the matching to get the segments to remove
while ($gap_line =~ m/[$del_char]/g) { my $start = pos($gap_line)-1; $gap_line=~/\G[$del_char]+/gc; my $end = pos($gap_line)-1; #have to offset the start and end for subsequent removes
$start-=$length; $end -=$length; $length += ($end-$start+1); push @remove, [$start,$end]; } #remove the segments
$aln = $#remove >= 0 ? $self->_remove_col($aln,\@remove) : $self; return $aln;
}
_remove_coldescriptionprevnextTop
sub _remove_col {
    my ($self,$aln,$remove) = @_;
    my @new;

    # splice out the segments and create new seq
foreach my $seq($self->each_seq){ my $new_seq = new Bio::LocatableSeq( -id => $seq->id, -strand => $seq->strand, -verbose => $self->verbose); my $sequence = $seq->seq; foreach my $pair(@{$remove}){ my $start = $pair->[0]; my $end = $pair->[1]; $sequence = $seq->seq unless $sequence; my $spliced; $spliced .= $start > 0 ? substr($sequence,0,$start) : ''; $spliced .= substr($sequence,$end+1,$seq->length-$end+1); $sequence = $spliced; if ($start == 1) { $new_seq->start($end); } else { $new_seq->start( $seq->start); } # end
if($end >= $seq->end){ $new_seq->end( $start); } else { $new_seq->end($seq->end); } } $new_seq->seq($sequence) if $sequence; push @new, $new_seq; } # add the new seqs to the alignment
foreach my $new(@new){ $aln->add_seq($new); } return $aln;
}
_remove_columns_by_typedescriptionprevnextTop
sub _remove_columns_by_type {
	my ($self,$type) = @_;
	my $aln = $self->new;
	my @remove;

	my $gap = $self->gap_char if (grep { $_ eq 'gaps'} @{$type});
	my $all_gaps_columns = $self->gap_char if (grep /all_gaps_columns/,@{$type});
	my %matchchars = ( 'match'           => '\*',
                       'weak'             => '\.',
                       'strong'           => ':',
                       'mismatch'         => ' ',
                       'gaps'             => '',
                       'all_gaps_columns' => ''
                     );
	# get the characters to delete against
my $del_char; foreach my $type (@{$type}){ $del_char.= $matchchars{$type}; } my $length = 0; my $match_line = $self->match_line; # do the matching to get the segments to remove
if($del_char){ while($match_line =~ m/[$del_char]/g ){ my $start = pos($match_line)-1; $match_line=~/\G[$del_char]+/gc; my $end = pos($match_line)-1; #have to offset the start and end for subsequent removes
$start-=$length; $end -=$length; $length += ($end-$start+1); push @remove, [$start,$end]; } } # remove the segments
$aln = $#remove >= 0 ? $self->_remove_col($aln,\@remove) : $self; $aln = $aln->remove_gaps() if $gap; $aln = $aln->remove_gaps('', 1) if $all_gaps_columns; $aln;
}
_remove_columns_by_numdescriptionprevnextTop
sub _remove_columns_by_num {
	my ($self,$positions) = @_;
	my $aln = $self->new;

	# sort the positions to remove columns at the end 1st
@$positions = sort { $b->[0] <=> $a->[0] } @$positions; $aln = $self->_remove_col($aln,$positions); $aln;
}
splice_by_seq_posdescriptionprevnextTop
sub splice_by_seq_pos {
  my ($self,$pos) = @_;

  my $guide = $self->get_seq_by_pos($pos);
  my $guide_seq = $guide->seq;

  $guide_seq =~ s/\./\-/g;

  my @gaps = ();
  $pos = -1;
  while(($pos = index($guide_seq, '-', $pos)) > -1 ){
    unshift @gaps, $pos;
    $pos++;
  }

  foreach my $seq ($self->each_seq){
    my @bases = split '', $seq->seq;

    splice(@bases, $_, 1) foreach @gaps;
    $seq->seq(join('', @bases));
  }

  1;
}
map_charsdescriptionprevnextTop
sub map_chars {
    my $self = shift;
    my $from = shift;
    my $to   = shift;
    my ($seq,$temp);

    $self->throw("Need exactly two arguments")
	unless defined $from and defined $to;

    foreach $seq ( $self->each_seq() ) {
	$temp = $seq->seq();
	$temp =~ s/$from/$to/g;
	$seq->seq($temp);
    }
    return 1;
}
uppercasedescriptionprevnextTop
sub uppercase {
    my $self = shift;
    my $seq;
    my $temp;

    foreach $seq ( $self->each_seq() ) {
      $temp = $seq->seq();
      $temp =~ tr/[a-z]/[A-Z]/;

      $seq->seq($temp);
    }
    return 1;
}
cigar_linedescriptionprevnextTop
sub cigar_line {
	my $self = shift;
	my %cigars;

	my @consensus = split "",($self->consensus_string(100));
	my $len = $self->length;
	my $gapchar = $self->gap_char;

	# create a precursor, something like (1,4,5,6,7,33,45),
# where each number corresponds to a conserved position
foreach my $seq ( $self->each_seq ) { my @seq = split "", uc ($seq->seq); my $pos = 1; for (my $x = 0 ; $x < $len ; $x++ ) { if ($seq[$x] eq $consensus[$x]) { push @{$cigars{$seq->get_nse}},$pos; $pos++; } elsif ($seq[$x] ne $gapchar) { $pos++; } } } # duplicate numbers - (1,4,5,6,7,33,45) becomes (1,1,4,5,6,7,33,33,45,45)
for my $name (keys %cigars) { splice @{$cigars{$name}}, 1, 0, ${$cigars{$name}}[0] if ( ${$cigars{$name}}[0] + 1 < ${$cigars{$name}}[1] ); push @{$cigars{$name}}, ${$cigars{$name}}[$#{$cigars{$name}}] if ( ${$cigars{$name}}[($#{$cigars{$name}} - 1)] + 1 < ${$cigars{$name}}[$#{$cigars{$name}}] ); for ( my $x = 1 ; $x < $#{$cigars{$name}} - 1 ; $x++) { if (${$cigars{$name}}[$x - 1] + 1 < ${$cigars{$name}}[$x] && ${$cigars{$name}}[$x + 1] > ${$cigars{$name}}[$x] + 1) { splice @{$cigars{$name}}, $x, 0, ${$cigars{$name}}[$x]; } } } # collapse series - (1,1,4,5,6,7,33,33,45,45) becomes (1,1,4,7,33,33,45,45)
for my $name (keys %cigars) { my @remove; for ( my $x = 0 ; $x < $#{$cigars{$name}} ; $x++) { if ( ${$cigars{$name}}[$x] == ${$cigars{$name}}[($x - 1)] + 1 && ${$cigars{$name}}[$x] == ${$cigars{$name}}[($x + 1)] - 1 ) { unshift @remove,$x; } } for my $pos (@remove) { splice @{$cigars{$name}}, $pos, 1; } } # join and punctuate
for my $name (keys %cigars) { my ($start,$end,$str) = ""; while ( ($start,$end) = splice @{$cigars{$name}}, 0, 2 ) { $str .= ($start . "," . $end . ":"); } $str =~ s/:$//; $cigars{$name} = $str; } %cigars;
}
match_linedescriptionprevnextTop
sub match_line {
	my ($self,$matchlinechar, $strong, $weak) = @_;
	my %matchchars = ('match'    => $matchlinechar || '*',
							  'weak'     => $weak          || '.',
							  'strong'   => $strong        || ':',
							  'mismatch' => ' ',
						  );

	my @seqchars;
	my $alphabet;
	foreach my $seq ( $self->each_seq ) {
		push @seqchars, [ split(//, uc ($seq->seq)) ];
		$alphabet = $seq->alphabet unless defined $alphabet;
	}
	my $refseq = shift @seqchars;
	# let's just march down the columns
my $matchline; POS: foreach my $pos ( 0..$self->length ) { my $refchar = $refseq->[$pos]; my $char = $matchchars{'mismatch'}; unless( defined $refchar ) { last if $pos == $self->length; # short circuit on last residue
# this in place to handle jason's soon-to-be-committed
# intron mapping code
goto bottom; } my %col = ($refchar => 1); my $dash = ($refchar eq '-' || $refchar eq '.' || $refchar eq ' '); foreach my $seq ( @seqchars ) { next if $pos >= scalar @$seq; $dash = 1 if( $seq->[$pos] eq '-' || $seq->[$pos] eq '.' || $seq->[$pos] eq ' ' ); $col{$seq->[$pos]}++ if defined $seq->[$pos]; } my @colresidues = sort keys %col; # if all the values are the same
if( $dash ) { $char = $matchchars{'mismatch'} } elsif( @colresidues == 1 ) { $char = $matchchars{'match'} } elsif( $alphabet eq 'protein' ) { # only try to do weak/strong
# matches for protein seqs
TYPE: foreach my $type ( qw(strong weak) ) { # iterate through categories
my %groups; # iterate through each of the aa in the col
# look to see which groups it is in
foreach my $c ( @colresidues ) { foreach my $f ( grep { index($_,$c) >= 0 } @{$CONSERVATION_GROUPS{$type}} ) { push @{$groups{$f}},$c; } } GRP: foreach my $cols ( values %groups ) { @$cols = sort @$cols; # now we are just testing to see if two arrays
# are identical w/o changing either one
# have to be same len
next if( scalar @$cols != scalar @colresidues ); # walk down the length and check each slot
for($_=0;$_ < (scalar @$cols);$_++ ) { next GRP if( $cols->[$_] ne $colresidues[$_] ); } $char = $matchchars{$type}; last TYPE; } } } bottom: $matchline .= $char; } return $matchline;
}
gap_linedescriptionprevnextTop
sub gap_line {
    my ($self,$gapchar) = @_;
    $gapchar = $gapchar || $self->gap_char;
    my %gap_hsh; # column gaps vector
foreach my $seq ( $self->each_seq ) { my $i = 0; map {$gap_hsh{$_->[0]} = undef} grep {$_->[1] eq $gapchar} map {[$i++, $_]} split(//, uc ($seq->seq)); } my $gap_line; foreach my $pos ( 0..$self->length-1 ) { $gap_line .= (exists $gap_hsh{$pos}) ? $gapchar:'.'; } return $gap_line;
}
all_gap_linedescriptionprevnextTop
sub all_gap_line {
    my ($self,$gapchar) = @_;
    $gapchar = $gapchar || $self->gap_char;
    my %gap_hsh;		# column gaps counter hash
my @seqs = $self->each_seq; foreach my $seq ( @seqs ) { my $i = 0; map {$gap_hsh{$_->[0]}++} grep {$_->[1] eq $gapchar} map {[$i++, $_]} split(//, uc ($seq->seq)); } my $gap_line; foreach my $pos ( 0..$self->length-1 ) { if (exists $gap_hsh{$pos} && $gap_hsh{$pos} == scalar @seqs) { # gaps column
$gap_line .= $gapchar; } else { $gap_line .= '.'; } } return $gap_line;
}
gap_col_matrixdescriptionprevnextTop
sub gap_col_matrix {
    my ($self,$gapchar) = @_;
    $gapchar = $gapchar || $self->gap_char;
    my %gap_hsh; # column gaps vector
my @cols; foreach my $seq ( $self->each_seq ) { my $i = 0; my $str = $seq->seq; my $len = $seq->length; my $ch; my $id = $seq->display_id; while( $i < $len ) { $ch = substr($str, $i, 1); $cols[$i++]->{$id} = ($ch eq $gapchar); } } return\@ cols;
}
matchdescriptionprevnextTop
sub match {
    my ($self, $match) = @_;

    $match ||= '.';
    my ($matching_char) = $match;
    $matching_char = "\\$match" if $match =~ /[\^.$|()\[\]]/ ;  #';
$self->map_chars($matching_char, '-'); my @seqs = $self->each_seq(); return 1 unless scalar @seqs > 1; my $refseq = shift @seqs ; my @refseq = split //, $refseq->seq; my $gapchar = $self->gap_char; foreach my $seq ( @seqs ) { my @varseq = split //, $seq->seq(); for ( my $i=0; $i < scalar @varseq; $i++) { $varseq[$i] = $match if defined $refseq[$i] && ( $refseq[$i] =~ /[A-Za-z\*]/ || $refseq[$i] =~ /$gapchar/ ) && $refseq[$i] eq $varseq[$i]; } $seq->seq(join '', @varseq); } $self->match_char($match); return 1;
}
unmatchdescriptionprevnextTop
sub unmatch {
    my ($self, $match) = @_;

    $match ||= '.';

    my @seqs = $self->each_seq();
    return 1 unless scalar @seqs > 1;

    my $refseq = shift @seqs ;
    my @refseq = split //, $refseq->seq;
    my $gapchar = $self->gap_char;
    foreach my $seq ( @seqs ) {
	my @varseq = split //, $seq->seq();
	for ( my $i=0; $i < scalar @varseq; $i++) {
	    $varseq[$i] = $refseq[$i] if defined $refseq[$i] &&
		( $refseq[$i] =~ /[A-Za-z\*]/ ||
		  $refseq[$i] =~ /$gapchar/ ) &&
		      $varseq[$i] eq $match;
	}
	$seq->seq(join '', @varseq);
    }
    $self->match_char('');
    return 1;
}
iddescriptionprevnextTop
sub id {
    my ($self, $name) = @_;

    if (defined( $name )) {
	$self->{'_id'} = $name;
    }

    return $self->{'_id'};
}
accessiondescriptionprevnextTop
sub accession {
    my ($self, $acc) = @_;

    if (defined( $acc )) {
	$self->{'_accession'} = $acc;
    }

    return $self->{'_accession'};
}
descriptiondescriptionprevnextTop
sub description {
    my ($self, $name) = @_;

    if (defined( $name )) {
	$self->{'_description'} = $name;
    }

    return $self->{'_description'};
}
missing_chardescriptionprevnextTop
sub missing_char {
    my ($self, $char) = @_;

    if (defined $char ) {
	$self->throw("Single missing character, not [$char]!") if CORE::length($char) > 1;
	$self->{'_missing_char'} = $char;
    }

    return $self->{'_missing_char'};
}
match_chardescriptionprevnextTop
sub match_char {
    my ($self, $char) = @_;

    if (defined $char ) {
	$self->throw("Single match character, not [$char]!") if CORE::length($char) > 1;
	$self->{'_match_char'} = $char;
    }

    return $self->{'_match_char'};
}
gap_chardescriptionprevnextTop
sub gap_char {
    my ($self, $char) = @_;

    if (defined $char || ! defined $self->{'_gap_char'} ) {
	$char= '-' unless defined $char;
	$self->throw("Single gap character, not [$char]!") if CORE::length($char) > 1;
	$self->{'_gap_char'} = $char;
    }
    return $self->{'_gap_char'};
}
symbol_charsdescriptionprevnextTop
sub symbol_chars {
   my ($self,$includeextra) = @_;

   unless ($self->{'_symbols'}) {
       foreach my $seq ($self->each_seq) {
           map { $self->{'_symbols'}->{$_} = 1; } split(//,$seq->seq);
       }
   }
   my %copy = %{$self->{'_symbols'}};
   if( ! $includeextra ) {
       foreach my $char ( $self->gap_char, $self->match_char,
			  $self->missing_char) {
	   delete $copy{$char} if( defined $char );
       }
   }
   return keys %copy;
}
scoredescriptionprevnextTop
sub score {
  my $self = shift;
  $self->{score} = shift if @_;
  return $self->{score};
}
consensus_stringdescriptionprevnextTop
sub consensus_string {
    my $self = shift;
    my $threshold = shift;

    my $out = "";
    my $len = $self->length - 1;

    foreach ( 0 .. $len ) {
	$out .= $self->_consensus_aa($_,$threshold);
    }
    return $out;
}
_consensus_aadescriptionprevnextTop
sub _consensus_aa {
    my $self = shift;
    my $point = shift;
    my $threshold_percent = shift || -1 ;
    my ($seq,%hash,$count,$letter,$key);
    my $gapchar = $self->gap_char;
    foreach $seq ( $self->each_seq() ) {
	$letter = substr($seq->seq,$point,1);
	$self->throw("--$point-----------") if $letter eq '';
	($letter eq $gapchar || $letter =~ /\./) && next;
	# print "Looking at $letter\n";
$hash{$letter}++; } my $number_of_sequences = $self->no_sequences(); my $threshold = $number_of_sequences * $threshold_percent / 100. ;
$count = -1; $letter = '?'; foreach $key ( sort keys %hash ) { # print "Now at $key $hash{$key}\n";
if( $hash{$key} > $count && $hash{$key} >= $threshold) { $letter = $key; $count = $hash{$key}; } } return $letter;
}
consensus_iupacdescriptionprevnextTop
sub consensus_iupac {
    my $self = shift;
    my $out = "";
    my $len = $self->length-1;

    # only DNA and RNA sequences are valid
foreach my $seq ( $self->each_seq() ) { $self->throw("Seq [". $seq->get_nse. "] is a protein") if $seq->alphabet eq 'protein'; } # loop over the alignment columns
foreach my $count ( 0 .. $len ) { $out .= $self->_consensus_iupac($count); } return $out;
}
_consensus_iupacdescriptionprevnextTop
sub _consensus_iupac {
    my ($self, $column) = @_;
    my ($string, $char, $rna);

    #determine all residues in a column
foreach my $seq ( $self->each_seq() ) { $string .= substr($seq->seq, $column, 1); } $string = uc $string; # quick exit if there's an N in the string
if ($string =~ /N/) { $string =~ /\W/ ? return 'n' : return 'N'; } # ... or if there are only gap characters
return '-' if $string =~ /^\W+$/; # treat RNA as DNA in regexps
if ($string =~ /U/) { $string =~ s/U/T/; $rna = 1; } # the following s///'s only need to be done to the _first_ ambiguity code
# as we only need to see the _range_ of characters in $string
if ($string =~ /[VDHB]/) { $string =~ s/V/AGC/; $string =~ s/D/AGT/; $string =~ s/H/ACT/; $string =~ s/B/CTG/; } if ($string =~ /[SKYRWM]/) { $string =~ s/S/GC/; $string =~ s/K/GT/; $string =~ s/Y/CT/; $string =~ s/R/AG/; $string =~ s/W/AT/; $string =~ s/M/AC/; } # and now the guts of the thing
if ($string =~ /A/) { $char = 'A'; # A A
if ($string =~ /G/) { $char = 'R'; # A and G (purines) R
if ($string =~ /C/) { $char = 'V'; # A and G and C V
if ($string =~ /T/) { $char = 'N'; # A and G and C and T N
} } elsif ($string =~ /T/) { $char = 'D'; # A and G and T D
} } elsif ($string =~ /C/) { $char = 'M'; # A and C M
if ($string =~ /T/) { $char = 'H'; # A and C and T H
} } elsif ($string =~ /T/) { $char = 'W'; # A and T W
} } elsif ($string =~ /C/) { $char = 'C'; # C C
if ($string =~ /T/) { $char = 'Y'; # C and T (pyrimidines) Y
if ($string =~ /G/) { $char = 'B'; # C and T and G B
} } elsif ($string =~ /G/) { $char = 'S'; # C and G S
} } elsif ($string =~ /G/) { $char = 'G'; # G G
if ($string =~ /C/) { $char = 'S'; # G and C S
} elsif ($string =~ /T/) { $char = 'K'; # G and T K
} } elsif ($string =~ /T/) { $char = 'T'; # T T
} $char = 'U' if $rna and $char eq 'T'; $char = lc $char if $string =~ /\W/; return $char;
}
consensus_metadescriptionprevnextTop
sub consensus_meta {
    my ($self, $meta) = @_;
    if ($meta and !$meta->isa('Bio::Seq::MetaI')) {
        $self->throw('Not a Bio::Seq::MetaI object');
    }
    return $self->{'_aln_meta'} = $meta if $meta;
    return $self->{'_aln_meta'}
}
is_flushdescriptionprevnextTop
sub is_flush {
    my ($self,$report) = @_;
    my $seq;
    my $length = (-1);
    my $temp;

    foreach $seq ( $self->each_seq() ) {
	if( $length == (-1) ) {
	    $length = CORE::length($seq->seq());
	    next;
	}

	$temp = CORE::length($seq->seq());
	if( $temp != $length ) {
	    $self->warn("expecting $length not $temp from ".
			$seq->display_id) if( $report );
	    $self->debug("expecting $length not $temp from ".
			 $seq->display_id);
	    $self->debug($seq->seq(). "\n");
	    return 0;
	}
    }

    return 1;
}
length_alndescriptionprevnextTop
sub length_aln {
    my $self = shift;
    $self->deprecated("length_aln - deprecated method. Use length() instead.");
    $self->length(@_);
}
lengthdescriptionprevnextTop
sub length {
    my $self = shift;
    my $seq;
    my $length = (-1);
    my ($temp,$len);

    foreach $seq ( $self->each_seq() ) {
        if ($self->isa("Bio::Seq::LargeSeqI")) {
            $temp = $seq->length();
        } else {
	    $temp = $seq->length;
        }
	if( $temp > $length ) {
	    $length = $temp;
	}
    }

    return $length;
}
maxname_lengthdescriptionprevnextTop
sub maxname_length {
    my $self = shift;
    $self->deprecated("maxname_length - deprecated method.".
		      " Use maxdisplayname_length() instead.");
    $self->maxdisplayname_length();
}
maxnse_lengthdescriptionprevnextTop
sub maxnse_length {
    my $self = shift;
    $self->deprecated("maxnse_length - deprecated method.".
		      " Use maxnse_length() instead.");
    $self->maxdisplayname_length();
}
maxdisplayname_lengthdescriptionprevnextTop
sub maxdisplayname_length {
    my $self = shift;
    my $maxname = (-1);
    my ($seq,$len);

    foreach $seq ( $self->each_seq() ) {
	$len = CORE::length $self->displayname($seq->get_nse());

	if( $len > $maxname ) {
	    $maxname = $len;
	}
    }

    return $maxname;
}
max_metaname_lengthdescriptionprevnextTop
sub max_metaname_length {
    my $self = shift;
    my $maxname = (-1);
    my ($seq,$len);
    
    # check seq meta first
for $seq ( $self->each_seq() ) { next if !$seq->isa('Bio::Seq::MetaI' || !$seq->meta_names); for my $mtag ($seq->meta_names) { $len = CORE::length $mtag; if( $len > $maxname ) { $maxname = $len; } } } # alignment meta
for my $meta ($self->consensus_meta) { next unless $meta; for my $name ($meta->meta_names) { $len = CORE::length $name; if( $len > $maxname ) { $maxname = $len; } } } return $maxname;
}
no_residuesdescriptionprevnextTop
sub no_residues {
    my $self = shift;
    my $count = 0;

    foreach my $seq ($self->each_seq) {
	my $str = $seq->seq();

	$count += ($str =~ s/[A-Za-z]//g);
    }

    return $count;
}
no_sequencesdescriptionprevnextTop
sub no_sequences {
    my $self = shift;

    return scalar($self->each_seq);
}
average_percentage_identitydescriptionprevnextTop
sub average_percentage_identity {
   my ($self,@args) = @_;

   my @alphabet = ('A','B','C','D','E','F','G','H','I','J','K','L','M',
                   'N','O','P','Q','R','S','T','U','V','W','X','Y','Z');

   my ($len, $total, $subtotal, $divisor, $subdivisor, @seqs, @countHashes);

   if (! $self->is_flush()) {
       $self->throw("All sequences in the alignment must be the same length");
   }

   @seqs = $self->each_seq();
   $len = $self->length();

   # load the each hash with correct keys for existence checks
for( my $index=0; $index < $len; $index++) { foreach my $letter (@alphabet) { $countHashes[$index]->{$letter} = 0; } } foreach my $seq (@seqs) { my @seqChars = split //, $seq->seq(); for( my $column=0; $column < @seqChars; $column++ ) { my $char = uc($seqChars[$column]); if (exists $countHashes[$column]->{$char}) { $countHashes[$column]->{$char}++; } } } $total = 0; $divisor = 0; for(my $column =0; $column < $len; $column++) { my %hash = %{$countHashes[$column]}; $subdivisor = 0; foreach my $res (keys %hash) { $total += $hash{$res}*($hash{$res} - 1); $subdivisor += $hash{$res}; } $divisor += $subdivisor * ($subdivisor - 1); } return $divisor > 0 ? ($total / $divisor )*100.0 : 0;
}
percentage_identitydescriptionprevnextTop
sub percentage_identity {
    my $self = shift;
    return $self->average_percentage_identity();
}
overall_percentage_identitydescriptionprevnextTop
sub overall_percentage_identity {
   my ($self,@args) = @_;

   my @alphabet = ('A','B','C','D','E','F','G','H','I','J','K','L','M',
                   'N','O','P','Q','R','S','T','U','V','W','X','Y','Z');

   my ($len, $total, @seqs, @countHashes);

   if (! $self->is_flush()) {
       $self->throw("All sequences in the alignment must be the same length");
   }

   @seqs = $self->each_seq();
   $len = $self->length();

   # load the each hash with correct keys for existence checks
for( my $index=0; $index < $len; $index++) { foreach my $letter (@alphabet) { $countHashes[$index]->{$letter} = 0; } } foreach my $seq (@seqs) { my @seqChars = split //, $seq->seq(); for( my $column=0; $column < @seqChars; $column++ ) { my $char = uc($seqChars[$column]); if (exists $countHashes[$column]->{$char}) { $countHashes[$column]->{$char}++; } } } $total = 0; for(my $column =0; $column < $len; $column++) { my %hash = %{$countHashes[$column]}; foreach ( values %hash ) { next if( $_ == 0 ); $total++ if( $_ == scalar @seqs ); last; } } return ($total / $len ) * 100.0;
}
column_from_residue_numberdescriptionprevnextTop
sub column_from_residue_number {
    my ($self, $name, $resnumber) = @_;

    $self->throw("No sequence with name [$name]") unless $self->{'_start_end_lists'}->{$name};
    $self->throw("Second argument residue number missing") unless $resnumber;

    foreach my $seq ($self->each_seq_with_id($name)) {
	my $col;
	eval {
	    $col = $seq->column_from_residue_number($resnumber);
	};
	next if $@;
	return $col;
    }

    $self->throw("Could not find a sequence segment in $name ".
		 "containing residue number $resnumber");
}
get_displaynamedescriptionprevnextTop
sub get_displayname {
    my $self = shift;
    $self->deprecated("get_displayname - deprecated method. Use displayname() instead.");
    $self->displayname(@_);
}
set_displaynamedescriptionprevnextTop
sub set_displayname {
    my $self = shift;
    $self->deprecated("set_displayname - deprecated method. Use displayname() instead.");
    $self->displayname(@_);
}
displaynamedescriptionprevnextTop
sub displayname {
    my ($self, $name, $disname) = @_;

    $self->throw("No sequence with name [$name]")
        unless defined $self->{'_seq'}->{$name};

    if(  $disname and  $name) {
	$self->{'_dis_name'}->{$name} = $disname;
	return $disname;
    }
    elsif( defined $self->{'_dis_name'}->{$name} ) {
	return  $self->{'_dis_name'}->{$name};
    } else {
	return $name;
    }
}
set_displayname_countdescriptionprevnextTop
sub set_displayname_count {
    my $self= shift;
    my (@arr,$name,$seq,$count,$temp,$nse);

    foreach $seq ( $self->each_alphabetically() ) {
	$nse = $seq->get_nse();

	#name will be set when this is the second
#time (or greater) is has been seen
if( defined $name and $name eq ($seq->id()) ) { $temp = sprintf("%s_%s",$name,$count); $self->displayname($nse,$temp); $count++; } else { $count = 1; $name = $seq->id(); $temp = sprintf("%s_%s",$name,$count); $self->displayname($nse,$temp); $count++; } } return 1;
}
set_displayname_flatdescriptionprevnextTop
sub set_displayname_flat {
    my $self = shift;
    my ($nse,$seq);

    foreach $seq ( $self->each_seq() ) {
	$nse = $seq->get_nse();
	$self->displayname($nse,$seq->id());
    }
    return 1;
}
set_displayname_normaldescriptionprevnextTop
sub set_displayname_normal {
    my $self = shift;
    my ($nse,$seq);

    foreach $seq ( $self->each_seq() ) {
	$nse = $seq->get_nse();
	$self->displayname($nse,$nse);
    }
    return 1;
}
sourcedescriptionprevnextTop
sub source {
   my ($self,$value) = @_;
   if( defined $value) {
      $self->{'_source'} = $value;
    }
    return $self->{'_source'};
}
annotationdescriptionprevnextTop
sub annotation {
    my ($obj,$value) = @_;
    if( defined $value ) {
        $obj->throw("object of class ".ref($value)." does not implement ".
                "Bio::AnnotationCollectionI. Too bad.")
            unless $value->isa("Bio::AnnotationCollectionI");
        $obj->{'_annotation'} = $value;
    } elsif( ! defined $obj->{'_annotation'}) {
        $obj->{'_annotation'} = Bio::Annotation::Collection->new();
    }
    return $obj->{'_annotation'};
}
General documentation
FEEDBACKTop
Mailing ListsTop
User feedback is an integral part of the evolution of this and other
Bioperl modules. Send your comments and suggestions preferably to one
of the Bioperl mailing lists. Your participation is much appreciated.
  bioperl-l@bioperl.org                  - General discussion
http://bioperl.org/wiki/Mailing_lists - About the mailing lists
Reporting BugsTop
Report bugs to the Bioperl bug tracking system to help us keep track
the bugs and their resolution. Bug reports can be submitted via the
web:
  http://bugzilla.open-bio.org/
AUTHORTop
Ewan Birney, birney@ebi.ac.uk
CONTRIBUTORSTop
Allen Day, allenday-at-ucla.edu,
Richard Adams, Richard.Adams-at-ed.ac.uk,
David J. Evans, David.Evans-at-vir.gla.ac.uk,
Heikki Lehvaslaiho, heikki-at-bioperl-dot-org,
Allen Smith, allens-at-cpan.org,
Jason Stajich, jason-at-bioperl.org,
Anthony Underwood, aunderwood-at-phls.org.uk,
Xintao Wei & Giri Narasimhan, giri-at-cs.fiu.edu
Brian Osborne, bosborne at alum.mit.edu
SEE ALSOTop
Bio::LocatableSeq
APPENDIXTop
The rest of the documentation details each of the object
methods. Internal methods are usually preceded with a _
Modifier methodsTop
These methods modify the MSA by adding, removing or shuffling complete
sequences.
Sequence selection methodsTop
Methods returning one or more sequences objects.
Create new alignmentsTop
The result of these methods are horizontal or vertical subsets of the
current MSA.
Change sequences within the MSATop
These methods affect characters in all sequences without changing the
alignment.
MSA attibutesTop
Methods for setting and reading the MSA attributes.
Note that the methods defining character semantics depend on the user
to set them sensibly. They are needed only by certain input/output
methods. Unset them by setting to an empty string ('').
Alignment descriptorsTop
These read only methods describe the MSA in various ways.
Alignment positionsTop
Methods to map a sequence position into an alignment column and back.
column_from_residue_number() does the former. The latter is really a
property of the sequence object and can done using
Bio::LocatableSeq::location_from_column:
    # select somehow a sequence from the alignment, e.g.
my $seq = $aln->get_seq_by_pos(1);
#$loc is undef or Bio::LocationI object
my $loc = $seq->location_from_column(5);
Sequence namesTop
Methods to manipulate the display name. The default name based on the
sequence id and subsequence positions can be overridden in various
ways.