Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
Algoritem za iskanje maksimalne klike pri problemu grupiranja sosesk za de novo določanje nukleotidnega zaporedja : magistrsko delo
ID
Slana, Uroš
(
Author
),
ID
Curk, Tomaž
(
Mentor
)
More about this mentor...
PDF - Presentation file,
Download
(1,18 MB)
MD5: CBD4A6D4B248D5E366E17D6D2ABDE3FD
Image galllery
Language:
Slovenian
Keywords:
algoritmi
,
maksimalna klika
,
sekvenciranje
,
grupiranje
,
soseske
,
teorija grafov
,
nukleotidno zaporedje
Work type:
Master's thesis
Typology:
2.09 - Master's Thesis
Organization:
BF - Biotechnical Faculty
Place of publishing:
Ljubljana
Publisher:
[U. Slana]
Year:
2016
Number of pages:
X, 62, [1] f.
PID:
20.500.12556/RUL-116886
UDC:
575:004(043)=163.6
COBISS.SI-ID:
853879
Publication date in RUL:
14.06.2020
Views:
1729
Downloads:
190
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
:
Copy citation
Share:
Secondary language
Language:
English
Title:
Algorithm for finding the maximum clique on the problem of contigs clustering for de novo determination of the nucleotide sequence
Keywords:
algorithm
,
maximal clique
,
sequencing
,
cluster
,
conting
,
garph theory
,
nucleotice sequence
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back