About: The Longest Common Subsequence Problem a Finite Automata Approach     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
  • A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in O(|A|(|S1|+|S2|+r)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and r is the number of matching pairs (such pair i,j that S1(i)=S2(j)). This algorithm can be simple generalized for multiple strings.
  • A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in O(|A|(|S1|+|S2|+r)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and r is the number of matching pairs (such pair i,j that S1(i)=S2(j)). This algorithm can be simple generalized for multiple strings. (en)
Title
  • The Longest Common Subsequence Problem a Finite Automata Approach
  • The Longest Common Subsequence Problem a Finite Automata Approach (en)
skos:prefLabel
  • The Longest Common Subsequence Problem a Finite Automata Approach
  • The Longest Common Subsequence Problem a Finite Automata Approach (en)
skos:notation
  • RIV/68407700:21230/03:03088936!RIV/2004/GA0/212304/N
http://linked.open.../vavai/riv/strany
  • 326 ; 327
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/01/1433), Z(MSM 212300014)
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
  • 613849
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/03:03088936
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • finite automata, common subsequence automata, longest common subsequence (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [B2F0BAFF02A0]
http://linked.open...v/mistoKonaniAkce
  • Praha
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • Proceedings of Workshop 2003
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
  • Melichar, Bořivoj
  • Polcar, Tomáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • České vysoké učení technické v Praze
https://schema.org/isbn
  • 80-01-02708-2
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