The way to make a tree for MSA?

xingjianleng / DBGA

The repository for the genome sequence alignment research project

BSD 3-Clause "New" or "Revised" License

3 stars 1 forks source link

Closed xingjianleng closed 1 year ago

xingjianleng commented 2 years ago

As title

GavinHuttley commented 2 years ago

the quickest coding-time (as distinct from quickest compute time) solution is

from cogent3.align.progressive import TreeAlign

aln = TreeAlign("F81", seqs)

this will perform pairwise alignments alignments then compute a NJ tree from that.