Zobrazeno 1 - 10
of 119
pro vyhledávání: '"Hiroshi ETO"'
Publikováno v:
Marine Drugs, Vol 17, Iss 7, p 421 (2019)
Low molecular weight fucoidan extract (LMF), prepared by an abalone glycosidase digestion of a crude fucoidan extracted from Cladosiphon novae-caledoniae Kylin, exhibits various biological activities, including anticancer effect. Various cancers expr
Externí odkaz:
https://doaj.org/article/577fba70110d42bca749a14364e0ea4e
Publikováno v:
Marine Drugs, Vol 11, Iss 1, Pp 81-98 (2013)
Fucoidan, a fucose-rich polysaccharide isolated from brown alga, is currently under investigation as a new anti-cancer compound. In the present study, fucoidan extract (FE) from Cladosiphon navae-caledoniae Kylin was prepared by enzymatic digestion.
Externí odkaz:
https://doaj.org/article/94454c1f570e42dda6dce98cd466a899
Publikováno v:
PLoS ONE, Vol 6, Iss 11, p e27441 (2011)
BACKGROUND: Fucoidan extract (FE), an enzymatically digested compound with a low molecular weight, is extracted from brown seaweed. As a natural compound with various actions, FE is attractive, especially in Asian countries, for improving the therape
Externí odkaz:
https://doaj.org/article/0d02bc75a207464c9ce55dc2dc850667
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1211-1222
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::794b5dd80c97ee4ba88b80073c0a2cdc
https://doi.org/10.1587/transfun.2021dmp0017
https://doi.org/10.1587/transfun.2021dmp0017
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031304477
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a4577b77ba32ae0ecd06c4d32c45264
https://doi.org/10.1007/978-3-031-30448-4_4
https://doi.org/10.1007/978-3-031-30448-4_4
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c27a860c61cdd94e487c55f2c7c2b2d2
https://doi.org/10.1007/978-3-031-27051-2_17
https://doi.org/10.1007/978-3-031-27051-2_17
Publikováno v:
Discrete Applied Mathematics. 304:32-44
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5ea952f6a0ab52547d480b9f0ab2f0c
https://doi.org/10.1016/j.dam.2021.07.005
https://doi.org/10.1016/j.dam.2021.07.005
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f92532d8afa412c24756e23ffeb65000
https://doi.org/10.1007/978-3-030-96731-4_4
https://doi.org/10.1007/978-3-030-96731-4_4
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::213be259086a2cfc8641103692bc19a9
https://doi.org/10.1007/978-3-030-96731-4_13
https://doi.org/10.1007/978-3-030-96731-4_13
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030398804
WALCOM
WALCOM
In this paper we introduce the Maximum Happy Set problem (MaxHS) and study its parameterized complexity: For an undirected graph \(G = (V, E)\) and a subset \(S\subseteq V\) of vertices, a vertex v is happy if v and all its neighbors are in S; and ot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72c7678f46a9d57585e20bd286d80c62
https://doi.org/10.1007/978-3-030-39881-1_27
https://doi.org/10.1007/978-3-030-39881-1_27