On the maximal cliques in <it>c</it>-max-tolerance graphs and their application in clustering molecular sequences
<p>Abstract</p> <p>Given a set <it>S </it>of <it>n </it>locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the generation of a phylogenetic tree. This ar...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2006-05-01
|
Series: | Algorithms for Molecular Biology |
Online Access: | http://www.almob.org/content/1/1/9 |