Dissertation/Thesis
View in EDS

A Windowed Version Of The Bunke And Bühler Algorithm To Better Approximate Dissimilarities Between Cyclic Patterns.

Bibliographic Details
Title: A Windowed Version Of The Bunke And Bühler Algorithm To Better Approximate Dissimilarities Between Cyclic Patterns.
Authors: R. A. Mollineda, E. Vidal, F. Casacuberta
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00e.ps.gz.
Publication Year: 2000
Collection: CiteSeerX
Subject Terms: Cyclic patterns, cyclic strings, approximate string matching, structural pattern analysis, 2D shape recognition
Description: An ecient approximate technique for measuring dissimilarities between cyclic patterns is presented. It is inspired on the quadratic time algorithm proposed by Bunke and Buhler (BBA). This algorithm computes an estimation of the distance measured between two cyclic strings x and y, by nding in an edit graph, an alignment between x with its most similar substring of some rotation of y. The technique presented in this paper de nes a diagonal window on the edit graph for each starting node where alignments originate from. Each alignment will be constrained to be within the window associated to its starting node. It guarantees alignments between x and substrings very close to some rotation of y, leading to a much better approximation to the exact cyclic distance value between x and y. Experiments were conducted on both arti cial and real data, to demonstrate the capabilities of the new technique in both accurateness and quadratic computing time.
Document Type: Thesis
File Description: application/postscript
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4732
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4732
http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00e.ps.gz
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.11AF8864
Database: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4732#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.11AF8864
RelevancyScore: 748
AccessLevel: 3
PubType: Dissertation/Thesis
PubTypeId: unknown
PreciseRelevancyScore: 748.449523925781
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Windowed Version Of The Bunke And Bühler Algorithm To Better Approximate Dissimilarities Between Cyclic Patterns.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22R%2E+A%2E+Mollineda%22">R. A. Mollineda</searchLink><br /><searchLink fieldCode="AR" term="%22E%2E+Vidal%22">E. Vidal</searchLink><br /><searchLink fieldCode="AR" term="%22F%2E+Casacuberta%22">F. Casacuberta</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: The Pennsylvania State University CiteSeerX Archives
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00e.ps.gz</i>.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2000
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: CiteSeerX
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Cyclic+patterns%22">Cyclic patterns</searchLink><br /><searchLink fieldCode="DE" term="%22cyclic+strings%22">cyclic strings</searchLink><br /><searchLink fieldCode="DE" term="%22approximate+string+matching%22">approximate string matching</searchLink><br /><searchLink fieldCode="DE" term="%22structural+pattern+analysis%22">structural pattern analysis</searchLink><br /><searchLink fieldCode="DE" term="%222D+shape+recognition%22">2D shape recognition</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: An ecient approximate technique for measuring dissimilarities between cyclic patterns is presented. It is inspired on the quadratic time algorithm proposed by Bunke and Buhler (BBA). This algorithm computes an estimation of the distance measured between two cyclic strings x and y, by nding in an edit graph, an alignment between x with its most similar substring of some rotation of y. The technique presented in this paper de nes a diagonal window on the edit graph for each starting node where alignments originate from. Each alignment will be constrained to be within the window associated to its starting node. It guarantees alignments between x and substrings very close to some rotation of y, leading to a much better approximation to the exact cyclic distance value between x and y. Experiments were conducted on both arti cial and real data, to demonstrate the capabilities of the new technique in both accurateness and quadratic computing time.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: Thesis
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/postscript
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4732
– Name: URL
  Label: Availability
  Group: URL
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4732<br />http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00e.ps.gz
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.11AF8864
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.11AF8864
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Cyclic patterns
        Type: general
      – SubjectFull: cyclic strings
        Type: general
      – SubjectFull: approximate string matching
        Type: general
      – SubjectFull: structural pattern analysis
        Type: general
      – SubjectFull: 2D shape recognition
        Type: general
    Titles:
      – TitleFull: A Windowed Version Of The Bunke And Bühler Algorithm To Better Approximate Dissimilarities Between Cyclic Patterns.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: R. A. Mollineda
      – PersonEntity:
          Name:
            NameFull: E. Vidal
      – PersonEntity:
          Name:
            NameFull: F. Casacuberta
      – PersonEntity:
          Name:
            NameFull: The Pennsylvania State University CiteSeerX Archives
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: http://www.iti.upv.es/~prhlt/PAPERS/papers96-00/2000/Mollineda00e.ps.gz
              Type: main
ResultId 1