This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7http://dbpedia.org/resource/File:
n13https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Ruzzo–Tompa_algorithm
Subject Item
dbr:Ruzzo–Tompa_algorithm
rdfs:label
Ruzzo–Tompa algorithm
rdfs:comment
The Ruzzo–Tompa algorithm is a linear-time algorithm for finding all non-overlapping, contiguous, maximal scoring subsequences in a sequence of real numbers. This algorithm is an improvement over previously known quadratic time algorithms. The maximum scoring subsequence from the set produced by the algorithm is also a solution to the maximum subarray problem. The Ruzzo–Tompa algorithm has applications in bioinformatics, web scraping, and information retrieval.
dcterms:subject
dbc:Articles_with_example_Python_(programming_language)_code dbc:Dynamic_programming dbc:Optimization_algorithms_and_methods
dbo:wikiPageID
57141126
dbo:wikiPageRevisionID
1112974739
dbo:wikiPageWikiLink
dbr:Maximum_subarray_problem dbr:Dynamic_programming dbr:Quicksort n7:Animation_of_Ruzzo-Tompa_Algorithm.ogv dbr:Bursting dbr:Sequence_alignment dbr:Protein dbr:0%5D_*_len(scores)_for__in_range(4)%5D dbc:Articles_with_example_Python_(programming_language)_code dbr:Lexical_analysis dbc:Dynamic_programming dbr:Web_scraping dbr:Sequence_homology dbr:DNA dbc:Optimization_algorithms_and_methods dbr:Data_fusion dbr:Bioinformatics dbr:RNA dbr:Time_complexity dbr:Algorithm dbr:Python_(programming_language) dbr:Information_retrieval
owl:sameAs
wikidata:Q55632140 n13:7168o
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
The Ruzzo–Tompa algorithm is a linear-time algorithm for finding all non-overlapping, contiguous, maximal scoring subsequences in a sequence of real numbers. This algorithm is an improvement over previously known quadratic time algorithms. The maximum scoring subsequence from the set produced by the algorithm is also a solution to the maximum subarray problem. The Ruzzo–Tompa algorithm has applications in bioinformatics, web scraping, and information retrieval.
prov:wasDerivedFrom
wikipedia-en:Ruzzo–Tompa_algorithm?oldid=1112974739&ns=0
dbo:wikiPageLength
9321
foaf:isPrimaryTopicOf
wikipedia-en:Ruzzo–Tompa_algorithm
Subject Item
dbr:Ruzzo-Tompa_algorithm
dbo:wikiPageWikiLink
dbr:Ruzzo–Tompa_algorithm
dbo:wikiPageRedirects
dbr:Ruzzo–Tompa_algorithm
Subject Item
wikipedia-en:Ruzzo–Tompa_algorithm
foaf:primaryTopic
dbr:Ruzzo–Tompa_algorithm