Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Knisley Debra J"'
Publikováno v:
BMC Bioinformatics, Vol 11, Iss Suppl 6, p S21 (2010)
Abstract Background Determining the secondary structure of RNA from the primary structure is a challenging computational problem. A number of algorithms have been developed to predict the secondary structure from the primary structure. It is agreed t
Externí odkaz:
https://doaj.org/article/fc96a2bb161141ae91f763ea90b541c3
Autor:
Favaron, Odile, Haynes, Teresa W. *, Hedetniemi, Stephen T., Henning, Michael A., Knisley, Debra J.
Publikováno v:
In Discrete Mathematics 2002 256(1):115-127
Autor:
Knisley, Debra J.1,2 knisleyd@etsu.edu, Knisley, Jeff R.1,2
Publikováno v:
BMC Proceedings. 8/28/2014, p1-8. 8p.
Autor:
Koessler, Denise R.1, Knisley, Debra J.1,2 knisleyd@etsu.edu, Knisley, Jeff1,2, Haynes, Teresa1,2
Publikováno v:
BMC Bioinformatics. 2010 Supplement 6, Vol. 11, p1-10. 10p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Knisley, Debra J.
Publikováno v:
Journal of Graph Theory; January 1994, Vol. 18 Issue: 1 p59-71, 13p
Autor:
Knisley, Debra J., Knisley, Jeff R.
Publikováno v:
ETSU Faculty Works.
We represent the protein structure of scTIM with a graph-theoretic model. We construct a hierarchical graph with three layers - a top level, a midlevel and a bottom level. The top level graph is a representation of the protein in which its vertices e
Externí odkaz:
https://dc.etsu.edu/etsu-works/15911
https://dc.etsu.edu/cgi/viewcontent.cgi?article=17177&context=etsu-works
https://dc.etsu.edu/cgi/viewcontent.cgi?article=17177&context=etsu-works
Publikováno v:
ETSU Faculty Works.
Background: Determining the secondary structure of RNA from the primary structure is a challenging computational problem. A number of algorithms have been developed to predict the secondary structure from the primary structure. It is agreed that ther
Externí odkaz:
https://dc.etsu.edu/etsu-works/16643
https://dc.etsu.edu/cgi/viewcontent.cgi?article=17909&context=etsu-works
https://dc.etsu.edu/cgi/viewcontent.cgi?article=17909&context=etsu-works
Publikováno v:
ETSU Faculty Works.
For a graph G = (V, E), a set S ⊆ V is total irredundant if for every vertex v ∈ V, the set N[v] - N[S - {v}] is not empty. The total irredundance number irt(G) is the minimum cardinality of a maximal total irredundant set of G. We study the stru
Externí odkaz:
https://dc.etsu.edu/etsu-works/19092
Autor:
Favaron, Odile, Haynes, Teresa W., Hedetniemi, Stephen T., Henning, Michael A., Knisley, Debra J.
Publikováno v:
ETSU Faculty Works.
Externí odkaz:
https://dc.etsu.edu/etsu-works/18905