Ontology type: schema:Chapter
2013
AUTHORSGregory Kucherov , Yakov Nekrich
ABSTRACTIn this paper we describe a data structure that supports pattern matching queries on a dynamically arriving text over an alphabet of constant size. Each new symbol can be prepended to T in O(1) expected worst-case time. At any moment, we can report all occurrences of a pattern P in the current text in O(|P| + k) time, where |P| is the length of P and k is the number of occurrences. This resolves, under assumption of constant size alphabet, a long-standing open problem of existence of a real-time indexing method for string matching (see [2]). More... »
PAGES650-660
Automata, Languages, and Programming
ISBN
978-3-642-39205-4
978-3-642-39206-1
http://scigraph.springernature.com/pub.10.1007/978-3-642-39206-1_55
DOIhttp://dx.doi.org/10.1007/978-3-642-39206-1_55
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1001227120
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0806",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information Systems",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Laboratoire d'Informatique Gaspard-Monge",
"id": "https://www.grid.ac/institutes/grid.462940.d",
"name": [
"Laboratoire d\u2019Informatique Gaspard Monge, Universit\u00e9 Paris-Est & CNRS, Marne-la-Vall\u00e9e, Paris, France"
],
"type": "Organization"
},
"familyName": "Kucherov",
"givenName": "Gregory",
"id": "sg:person.013163701366.40",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013163701366.40"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Kansas",
"id": "https://www.grid.ac/institutes/grid.266515.3",
"name": [
"Department of Electrical Engineering & Computer Science, University of Kansas, USA"
],
"type": "Organization"
},
"familyName": "Nekrich",
"givenName": "Yakov",
"id": "sg:person.014556642366.63",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014556642366.63"
],
"type": "Person"
}
],
"citation": [
{
"id": "sg:pub.10.1007/3-540-08921-7_97",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1001138670",
"https://doi.org/10.1007/3-540-08921-7_97"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1145/322234.322244",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1002627098"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-21458-5_16",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1011929559",
"https://doi.org/10.1007/978-3-642-21458-5_16"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-21458-5_16",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1011929559",
"https://doi.org/10.1007/978-3-642-21458-5_16"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-31265-6_16",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1012866216",
"https://doi.org/10.1007/978-3-642-31265-6_16"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-540-27836-8_52",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1014166115",
"https://doi.org/10.1007/978-3-540-27836-8_52"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-540-27836-8_52",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1014166115",
"https://doi.org/10.1007/978-3-540-27836-8_52"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/11575832_9",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1017195072",
"https://doi.org/10.1007/11575832_9"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/11575832_9",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1017195072",
"https://doi.org/10.1007/11575832_9"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1145/1541885.1541889",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1017405123"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/s0022-0000(05)80064-9",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1017760034"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-24583-1_16",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1028745906",
"https://doi.org/10.1007/978-3-642-24583-1_16"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-24583-1_16",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1028745906",
"https://doi.org/10.1007/978-3-642-24583-1_16"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1137/1.9781611973099.84",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1088801552"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/focs.2012.79",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1095553984"
],
"type": "CreativeWork"
}
],
"datePublished": "2013",
"datePublishedReg": "2013-01-01",
"description": "In this paper we describe a data structure that supports pattern matching queries on a dynamically arriving text over an alphabet of constant size. Each new symbol can be prepended to T in O(1) expected worst-case time. At any moment, we can report all occurrences of a pattern P in the current text in O(|P|\u2009+\u2009k) time, where |P| is the length of P and k is the number of occurrences. This resolves, under assumption of constant size alphabet, a long-standing open problem of existence of a real-time indexing method for string matching (see [2]).",
"editor": [
{
"familyName": "Fomin",
"givenName": "Fedor V.",
"type": "Person"
},
{
"familyName": "Freivalds",
"givenName": "R\u016bsi\u0146\u0161",
"type": "Person"
},
{
"familyName": "Kwiatkowska",
"givenName": "Marta",
"type": "Person"
},
{
"familyName": "Peleg",
"givenName": "David",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-642-39206-1_55",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-642-39205-4",
"978-3-642-39206-1"
],
"name": "Automata, Languages, and Programming",
"type": "Book"
},
"name": "Full-Fledged Real-Time Indexing for Constant Size Alphabets",
"pagination": "650-660",
"productId": [
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-642-39206-1_55"
]
},
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"05d8641685a90bf5590e7c61fce2b2eea6319376393a76366ad272d237046dd3"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1001227120"
]
}
],
"publisher": {
"location": "Berlin, Heidelberg",
"name": "Springer Berlin Heidelberg",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-642-39206-1_55",
"https://app.dimensions.ai/details/publication/pub.1001227120"
],
"sdDataset": "chapters",
"sdDatePublished": "2019-04-15T12:29",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8663_00000243.jsonl",
"type": "Chapter",
"url": "http://link.springer.com/10.1007/978-3-642-39206-1_55"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-39206-1_55'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-39206-1_55'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-39206-1_55'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-39206-1_55'
This table displays all metadata directly associated to this object as RDF triples.
129 TRIPLES
23 PREDICATES
38 URIs
20 LITERALS
8 BLANK NODES