Let d$ d:2 \* . $0 denote the nonincreasing sequence d,, . . . , d,, d,, . . . , d 2 , . . . , d,, . . . , dp, where the term d, appears kj times ( i = 1 . 2 , . . . , p ) . In this work the author proves that the maximal 2sequences: 7361515, 756' 5", 776' 5" are planar graphical, in contrast to a c
An unresolved conjecture on nonmaximal planar graphical sequences
β Scribed by Stefano Fanelli
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 229 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this work it is shown that the E&x nonmaxir:lal sequences, 5S555555555553 755555555555555555 (more briefly 5133' 7'5") are not pl-nar graphical, partly proving an unresolved conjecture by Schmeichel and Hakimi.
π SIMILAR VOLUMES
## Abstract Over annotation of protein coding genes is common phenomenon in microbial genomes, the genome of Amsacta moorei entomopoxvirus (AmEPV) is a typical case, because more than 63% of its annotated ORFs are hypothetical. In this article, we propose an improved graphical representation titled
## Abstract A (twoβdimensional) 2D graphical representation of protein sequences based on six physicochemical properties of amino acids is outlined. The numerical characterization of protein graphs is given as descriptors of protein sequences. It is not only useful for comparative study of proteins
## Abstract On the basis of a class of 2D graphical representations of DNA sequences, sensitivity analysis has been performed, showing the highβcapability of the proposed representations to take into account small modifications of the DNA sequences. And sensitivity analysis also indicates that the