๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A clique-detection algorithm based on neighborhoods in graphs

โœ Scribed by Robert E. Osteen; Julius T. Tou

Publisher
Springer
Year
1973
Tongue
English
Weight
656 KB
Volume
2
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial algorithm for the minimum w
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
โœ Wen-Lian HSU; George L. Nemhauser ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection

An upper bound on the number of cliques
An upper bound on the number of cliques in a graph
โœ Martin Farber; Mihรกly Hujter; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 1 views
Multiple sequence alignment algorithm ba
Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm
โœ Weiyang Chen; Bo Liao; Wen Zhu; Xuyu Xiang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 213 KB

## Abstract In this article, we describe a representation for the processes of multiple sequences alignment (MSA) and used it to solve the problem of MSA. By this representation, we took every possible aligning result into account by defining the representation of gap insertion, the value of heuris