About: Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • V článku představujeme lineární algoritmy na konstrukci dvou nových typů konečných automatů a ukazujeme, jak je lze využít k výpočtu omezené nejdelší společné podposloupnosti pro degenrované řetězce. (cs)
  • In this paper, we present linear-time algorithms for the construction two novel types of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS) problem for degenerate strings.
  • In this paper, we present linear-time algorithms for the construction two novel types of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS) problem for degenerate strings. (en)
Title
  • Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata
  • Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata (en)
  • Výpočet omezené nejdelší společné podposloupnosti pro degenerované řetězce pomocí konečných automatů (cs)
skos:prefLabel
  • Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata
  • Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata (en)
  • Výpočet omezené nejdelší společné podposloupnosti pro degenerované řetězce pomocí konečných automatů (cs)
skos:notation
  • RIV/68407700:21230/07:03133389!RIV08-GA0-21230___
http://linked.open.../vavai/riv/strany
  • 94;106
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/06/1039)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 414682
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:03133389
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • finite automata, constrained longest common subsequence (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [A16DB693AB6C]
http://linked.open...v/mistoKonaniAkce
  • Durham
http://linked.open...i/riv/mistoVydani
  • London
http://linked.open...i/riv/nazevZdroje
  • Algorithms and Complexity in Durham 2007
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Iliopoulos, C. S.
  • Vagner, Ladislav
  • Voráček, Michal
  • Rahman, S. M.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • King's College
https://schema.org/isbn
  • 978-1-904987-55-0
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software