Cargando…
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n 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 article introduces a new method of clustering which partitions S into subsets suc...
Autores principales: | Lehmann, Katharina A, Kaufmann, Michael, Steigele, Stephan, Nieselt, Kay |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2006
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1524773/ https://www.ncbi.nlm.nih.gov/pubmed/16737529 http://dx.doi.org/10.1186/1748-7188-1-9 |
Ejemplares similares
-
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
por: Phillips, Charles A., et al.
Publicado: (2019) -
Maximal Clique Based Influence Maximization in Networks
por: Mhadhbi, Nizar, et al.
Publicado: (2020) -
Monochromatic Clique Decompositions of Graphs
por: Liu, Henry, et al.
Publicado: (2015) -
Open reading frames provide a rich pool of potential natural antisense transcripts in fungal genomes
por: Steigele, Stephan, et al.
Publicado: (2005) -
Clustering cliques for graph-based summarization of the biomedical research literature
por: Zhang, Han, et al.
Publicado: (2013)