{"id":"https://openalex.org/W2965370271","doi":null,"title":"Pobolj\u0161ano sufiksno polje","display_name":"Pobolj\u0161ano sufiksno polje","publication_year":2015,"publication_date":"2015-07-13","ids":{"openalex":"https://openalex.org/W2965370271","mag":"2965370271"},"language":"sl","primary_location":{"id":"mag:2965370271","doi":null,"is_oa":false,"landing_page_url":"http://repozitorij.fer.unizg.hr/islandora/object/fer:957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083642371","display_name":"Antea Hadviger","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Antea Hadviger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5083642371"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/suffix-arrays","display_name":"suffix arrays","score":0.8529999852180481},{"id":"https://openalex.org/keywords/suffix-trees","display_name":"suffix trees","score":0.7210000157356262},{"id":"https://openalex.org/keywords/text-indexing","display_name":"text indexing","score":0.8169999718666077},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"pattern matching","score":0.6779999732971191},{"id":"https://openalex.org/keywords/dna-sequence-analysis","display_name":"DNA sequence analysis","score":0.8149999976158142},{"id":"https://openalex.org/keywords/longest-common-prefix-array","display_name":"longest common prefix array","score":0.9649999737739563},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.671999990940094}],"concepts":[{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.9048998355865479},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.8975894451141357},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.7785495519638062},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.7504276037216187},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6824009418487549},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.6577361822128296},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6529836654663086},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.5991175770759583},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5958822965621948},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5695421695709229},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4649324119091034},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4632704257965088},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4509600102901459},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.42695146799087524},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42259398102760315},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41634097695350647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40185147523880005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28085070848464966},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.20588156580924988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19782620668411255},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1795094609260559},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10133528709411621},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06852751970291138},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2965370271","doi":null,"is_oa":false,"landing_page_url":"http://repozitorij.fer.unizg.hr/islandora/object/fer:957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2187992379","https://openalex.org/W2158585409","https://openalex.org/W2087835429","https://openalex.org/W3217252310","https://openalex.org/W1503962612","https://openalex.org/W1749587086","https://openalex.org/W7100400140","https://openalex.org/W7095492925","https://openalex.org/W2159942118","https://openalex.org/W7097975832"],"abstract_inverted_index":{"Bioinformatics":[0],"problems":[1,19],"often":[2],"require":[3],"pattern":[4],"matching":[5],"large":[6],"texts":[7],"(DNA":[8],"sequences)":[9],"with":[10,50],"different":[11],"patterns.":[12],"To":[13],"find":[14],"a":[15,21,44],"solution":[16],"to":[17,27],"these":[18],"in":[20,77],"reasonable":[22],"time,":[23],"it":[24,73],"is":[25,41],"required":[26],"use":[28],"efficient":[29],"text":[30],"indexing":[31],"structures,":[32],"like":[33],"suffix":[34,38,46,80],"tree":[35],"or":[36],"enhanced":[37,49],"array.":[39],"It":[40],"made":[42],"of":[43],"regular":[45],"array":[47],"and":[48,66],"several":[51],"additional":[52],"structures":[53],"(longest":[54],"common":[55],"prefix":[56],"array,":[57],"child":[58],"table).":[59],"With":[60],"less":[61],"memory":[62],"consumption,":[63],"simpler":[64],"implementation":[65],"linear":[67],"construction":[68],"complexity,":[69],"using":[70],"SA-IS":[71],"algorithm,":[72],"shows":[74],"better":[75],"results":[76],"practice":[78],"than":[79],"trees":[81],"while":[82],"keeping":[83],"all":[84],"the":[85],"complex":[86],"functionality.":[87]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2019-08-13T00:00:00"}