Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
University of Nova Gorica
University
Study
Research
Repository of University of Nova Gorica
About
Search
Browse
Statistics
Login
Show document
A+
|
A-
|
|
SLO
|
ENG
Title:
Separation of small molecules on monolithic chromatographic materials
Authors:
ID
Jančar, Janez
(Author)
ID
Podgornik, Aleš
(Mentor)
More about this mentor...
Files:
30Jancar.pdf
(1,68 MB)
MD5: 1DE26728CDFEC6628D044E8005E55B6A
http://www.ung.si/~library/magisterij/okolje/30Jancar.pdf
Language:
English
Work type:
Master's thesis
Typology:
2.09 - Master's Thesis
Organization:
FZO - Faculty of Environmental Sciences
Keywords:
monolitni kromatografski materiali
,
molekule
,
tekočinska kromatografija
,
separacijske tehnike
,
čiščenje bioloških molekul
,
magistrske naloge
Place of publishing:
Nova Gorica
Publisher:
J. Jančar
Year of publishing:
2013
Number of pages:
78 str.
PID:
20.500.12556/RUNG-409
COBISS.SI-ID:
2770939
UDC:
543.544
NUK URN:
URN:SI:UNG:REP:DZAWTSBO
Publication date in RUNG:
15.10.2013
Views:
8494
Downloads:
432
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
JANČAR, Janez, 2013,
Separation of small molecules on monolithic chromatographic materials
[online]. Master’s thesis. Nova Gorica : J. Jančar. [Accessed 18 April 2025]. Retrieved from: https://repozitorij.ung.si/IzpisGradiva.php?lang=eng&id=409
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
No similar works found
Similar works from other repositories:
Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19
Računanje notranjega obsega ravninskih grafov
Algoritmi za generiranje labirintov
Hevristični algoritem za 3-barvanje grafov
Fast recognition of subclasses of almost-median graphs
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Back