{"@context":{"ns0":"https://w3id.org/amv#","rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","owl":"http://www.w3.org/2002/07/owl#","rdfs":"http://www.w3.org/2000/01/rdf-schema#","metadata":"http://data.bioontology.org/metadata/","metadata_def":"http://data.bioontology.org/metadata/def/","ns1":"http://www.wikidata.org/entity/"},"@graph":[{"@id":"ns0:Algorithm","@type":"owl:Class","rdfs:subClassOf":{"@id":"owl:Thing"},"rdfs:comment":{"@language":"en","@value":"It is a finite and unambiguous sequence of computer implementable instructions to perform a certain task. This can be a simple process, such as adding two numbers together, or a complex function, such as adding effects to an image. It can be expressed within a finite amount of space and time and in a well-defined formal language."},"rdfs:label":"Algorithm","metadata:prefixIRI":"amv:Algorithm","metadata:def/prefLabel":"Algorithm","metadata:def/mappingLoom":"algorithm","metadata:def/mappingSameURI":{"@id":"ns0:Algorithm"}},{"@id":"ns0:A*Algorithm","@type":"ns0:Algorithm"},{"@id":"ns0:BeadSort","@type":"ns0:Algorithm"},{"@id":"ns0:BellmanFordAlgorithm","@type":"ns0:Algorithm"},{"@id":"ns0:BestBinFirst","@type":"ns0:Algorithm"},{"@id":"ns0:BlockSort","@type":"ns0:Algorithm"},{"@id":"ns0:BubbleSort","@type":"ns0:Algorithm"},{"@id":"ns0:ChristofidesAlgorithm","@type":"ns0:Algorithm"},{"@id":"ns0:DataExtractionFromSbr","@type":"ns0:Algorithm"},{"@id":"ns0:DijkstrasAlgorithm","@type":"ns0:Algorithm"},{"@id":"ns0:EncoderDecoder","@type":"ns0:Algorithm"},{"@id":"ns0:FastMultipoleMethod","@type":"ns0:Algorithm"},{"@id":"ns0:HeapSort","@type":"ns0:Algorithm"},{"@id":"ns0:InsertionSort","@type":"ns0:Algorithm"},{"@id":"ns0:MergeSort","@type":"ns0:Algorithm"},{"@id":"ns0:QuickSort","@type":"ns0:Algorithm"},{"@id":"ns0:SelectionSort","@type":"ns0:Algorithm"},{"@id":"ns0:SmoothSort","@type":"ns0:Algorithm"},{"@id":"ns0:TimSort","@type":"ns0:Algorithm"},{"@id":"ns0:UserQueryProcessingAlgorithm","@type":"ns0:Algorithm"},{"@id":"ns1:Q8366","owl:equivalentClass":{"@id":"ns0:Algorithm"}},{"@id":"ns0:accessibility","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:analysisFunctionType","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:computesSolutionTo","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:constraint","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:dataStructureUsed","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:edgeCase","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:firstWrittenRecord","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:flexible","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:formOfExpression","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:hasMessageComplexity","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:hasMetric","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:hasPerformanceMetric","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:hasSpaceComplexity","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:hasSubalgorithm","rdfs:range":{"@id":"ns0:Algorithm"},"rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:hasTimeComplexity","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:inputDescription","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:isATypeOf","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:loopConstruct","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:mathematicalProperty","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:numberOfNestedLoops","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:numberOfSteps","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:offlineAlgorithm","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:onlineAlgorithm","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:optimal","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:pub_appearedIn","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:readable","rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:subalgorithmOf","rdfs:range":{"@id":"ns0:Algorithm"},"rdfs:domain":{"@id":"ns0:Algorithm"}},{"@id":"ns0:algorithmTypeFor","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:analysisFunctionTypeOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:availableAlgorithm","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:dataStructureUsedIn","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:formOfExpressionOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:loopConstructOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:mathematicalPropertyUsed","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:messageComplexityOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:metricOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:performanceMetricOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:pub_contains","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:spaceComplexityOf","rdfs:range":{"@id":"ns0:Algorithm"}},{"@id":"ns0:timeComplexityOf","rdfs:range":{"@id":"ns0:Algorithm"}}]}