This HTML5 document contains 41 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/
n11https://cm.jefferson.edu/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n21https://global.dbpedia.org/id/
n16https://cm.jefferson.edu/Teiresias/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n17http://cm.jefferson.edu/teiresias-code/
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:RNA22
dbo:wikiPageWikiLink
dbr:Teiresias_algorithm
Subject Item
dbr:Chung_Kwei_(algorithm)
dbo:wikiPageWikiLink
dbr:Teiresias_algorithm
Subject Item
dbr:Tiresias_(disambiguation)
dbo:wikiPageWikiLink
dbr:Teiresias_algorithm
Subject Item
dbr:Teiresias_algorithm
rdf:type
yago:Procedure101023820 yago:WikicatAlgorithms yago:Algorithm105847438 yago:Act100030358 dbo:Software yago:Abstraction100002137 yago:Rule105846932 yago:Event100029378 yago:YagoPermanentlyLocatedEntity yago:Activity100407535 yago:PsychologicalFeature100023100
rdfs:label
Teiresias algorithm
rdfs:comment
The Teiresias algorithm is a combinatorial algorithm for the discovery of rigid patterns (motifs) in biological sequences. It is named after the Greek prophet Teiresias and was created in 1997 by and . A new implementation of the Teiresias algorithm was recently made available by the Computational Medicine Center at Thomas Jefferson University. Teiresias is also accessible through an interactive web-based user interface by the same center. See external links for both.
dcterms:subject
dbc:Data_mining_algorithms dbc:Pattern_matching
dbo:wikiPageID
41662744
dbo:wikiPageRevisionID
786937066
dbo:wikiPageWikiLink
dbr:Regular_expressions dbr:Aris_Floratos dbr:Isidore_Rigoutsos dbr:Teiresias dbc:Data_mining_algorithms dbc:Pattern_matching dbr:NP-hard
dbo:wikiPageExternalLink
n11: n16: n17:
owl:sameAs
yago-res:Teiresias_algorithm freebase:m.0_86trn wikidata:Q17146050 n21:gU66
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
The Teiresias algorithm is a combinatorial algorithm for the discovery of rigid patterns (motifs) in biological sequences. It is named after the Greek prophet Teiresias and was created in 1997 by and . The problem of finding sequence similarities in the primary structure of related proteins or genes arises in the analysis of biological sequences. It can be shown that pattern discovery in its general form is NP-hard. The Teiresias algorithm is based on the observation that if a pattern spans many positions and appears exactly k times in the input then all fragments (sub patterns) of the pattern have to appear at least k times in the input. The algorithm is able to produce all patterns that have a user-defined number of copies in the given input, and manages to be very efficient by avoiding the enumeration of the entire space. Finally, the algorithm reports motifs that are maximal in both length and composition. A new implementation of the Teiresias algorithm was recently made available by the Computational Medicine Center at Thomas Jefferson University. Teiresias is also accessible through an interactive web-based user interface by the same center. See external links for both.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Teiresias_algorithm?oldid=786937066&ns=0
dbo:wikiPageLength
5812
foaf:isPrimaryTopicOf
wikipedia-en:Teiresias_algorithm
Subject Item
wikipedia-en:Teiresias_algorithm
foaf:primaryTopic
dbr:Teiresias_algorithm