✦ LIBER ✦

Multiple Sequence Comparison and Consistency on Multipartite Graphs

✍ Scribed by M. Vingron; P.A. Pevzner

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 897 KB
Volume: 16
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1995.1001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ramsey numbers involving starlike mul

On Ramsey numbers involving starlike multipartite graphs

✍ S. A. Burr; R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

The Ramsey number r ( G , H ) is evaluated exactly in certain cases in which both G and H are complete multipartite graphs K(n,, n2, ..., n k ) . Specifically, each of the following cases is handled whenever n is sufficiently large: r(K(1, m,, ..., m k ) , K(1, n)), r(K(1, m), K(n,, ..., nk, n)), pr

On balanced signed graphs and consistent

On balanced signed graphs and consistent marked graphs

✍ Fred S. Roberts 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 560 KB

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

On double and multiple interval graphs

✍ William T. Trotter Jr.; Frank Harary 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

## Abstract In this paper we discuss a generalization of the familiar concept of an interval graph that arises naturally in scheduling and allocation problems. We define the interval number of a graph __G__ to be the smallest positive integer __t__ for which there exists a function __f__ which assi

On the chromatic number of multiple inte

On the chromatic number of multiple interval graphs and overlap graphs

✍ A. Gyárfás 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Let x(G) and o(G) denote the chromatic number and clique number of a graph G. We prove that x can be bounded by a function of o for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line

On the number of edge-disjoint one facto

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

✍ D.G. Hoffman; C.A. Rodger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple