[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/jco/ArimuraU07>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hiroki_Arimura>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Takeaki_Uno>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs10878-006-9029-1>
foaf:homepage <https://doi.org/10.1007/s10878-006-9029-1>
dc:identifier DBLP journals/jco/ArimuraU07 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs10878-006-9029-1 (xsd:string)
dcterms:issued 2007 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/jco>
rdfs:label An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hiroki_Arimura>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Takeaki_Uno>
swrc:number 3 (xsd:string)
swrc:pages 243-262 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/jco/ArimuraU07/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/jco/ArimuraU07>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/jco/jco13.html#ArimuraU07>
rdfs:seeAlso <https://doi.org/10.1007/s10878-006-9029-1>
dc:subject Motif; Maximal motif; Data mining; Sequence mining; Algorithm; Delay; Enumeration; Polynomial time; Closed itemset; Closed pattern; Pattern discovery (xsd:string)
dc:title An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 13 (xsd:string)