Florência Leonardi, Antônio Galves.
Efficient family classification of newly discovered protein sequences is a central problem in bioinformatics. We present a new algorithm, using Probabilistic Sufx Trees, which identifies equivalences between the amino acids in different positions of a motif for each family. We also show that better classification can be achieved identifying representative fingerprints in the amino acid chains.
http://www.lbd.dcc.ufmg.br/colecoes/bsb/2005/026.pdf
Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web