About: A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem   Goto Sponge  NotDistinct  Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

AttributesValues
type
isDefinedBy
has title
  • A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
Creator
  • Fernández, Antonio
  • Blum, Christian
  • Cotta, Carlos
  • Gallardo, José
Source
  • PMC
abstract
has issue date
bibo:doi
  • 10.1007/978-3-540-71615-0_4
has license
  • no-cc
sha1sum (hex)
  • a5a4d16620ccffe16ffa64e0d9d18d66b2c8021d
schema:url
resource representing a document's title
has PubMed Central identifier
  • PMC7120107
schema:publication
  • Evolutionary Computation in Combinatorial Optimization
resource representing a document's body
is schema:about of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software