1 reply to this topic

[rsingh2083]

Hi all, Im a bioinformatician at a research centre.So I am trying to build a supertree using the algorithm "TreeConstruct" described in section 7.2.3 of this article - http://citeseerx.ist...p=rep1&type=pdf

I have managed to write a code to read the triplets and display the connections (ignoring redundancy)

use strict;
use warnings;

@ARGV = ('a,b|c', 'c,d|e', 'a,d|e') unless @ARGV;

my %HoA;
foreach ( @ARGV ) {
m/^([a-z])[,]([a-z])[|]([a-z])$/ ;
push @{$HoA{$1}}, $2;
}
print "\n===========\@HoA=====\n";
print "from->to\n";
while (my ($key, $values) = each %HoA) {
print $key, "=> [", join(',', @$values), "]\n";
}


#[vanilla@localhost perl]$ perl input.pl

#===========@HoA=====
#from->to
#c=> [d]
#a=> [b,d]

But Im not able to proceed beyond this point. Especially the second and third step of the algorithm are very difficult for me to implement. Please help

[BlackRabbit]

BioPerl is the solution for you. It has your algorithm already developed, and many other functions for the biogenetics field.
Bio:Perl