• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

Upp till 20% på populära nyheter →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare

    Mina sidor

      Hjälp

      • Kundservice
      • Vanliga frågor och svar
      • Frakt och leverans
      • Retur vid ångerrätt
      • Reklamera vara
      • Betalning
      • Köpvillkor
      • Allmänna villkor
      • Information om webbplatsens tillgänglighet

      Om Bokus

      • Om oss
      • Pressrum
      • För studenter
      • För företag
      • För bibliotek och offentlig verksamhet
      • För leverantörer
      • Hållbarhet

      Populärt

      • Aktuella erbjudanden
      • Presentkort
      • Studentlitteratur
      • Nya böcker
      • Topplistor
      • Signerade böcker
      • Engelska böcker

      Inspiration

      • Boktips
      • BookTok
      • Populära bokserier
      • Barnbokskaraktärer
      • Populära författare
      Logotyp för Bokus
      Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
      bokus @ CookiesIntegritetspolicyKöpvillkor
      Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
      1. Data och IT
      2. Informationsteknik: allmänt

      Combinatorial Pattern Matching

      16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings

      AvAlberto Apostolico,Maxime Crochemore

      Häftad, Engelska, 2005

      Del i serien Lecture Notes in Computer Science

      577 kr

      Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

      Beskrivning

      The 16th Annual Symposium on Combinatorial Pattern Matching was held on Jeju Island, Korea on June 19-22, 2005. Previous meetings were held in Paris, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus, Piscataway,Warwick,Montreal,Jerusalem,Fukuoka, Morelia,and Istanbul over the years 1990-2004. In response to the call for papers, CPM 2005 received a record number of 129papers.Eachsubmissionwasreviewedbyatleast threeProgramCommittee members with the assistance of external referees. Since there were many hi- quality papers, the Program Committee's task was extremely di?cult. Through an extensive discussion the Program Committee accepted 37 of the submissions tobepresentedattheconference.Theyconstituteoriginalresearchcontributions in combinatorial pattern matching and its applications. Inadditiontotheselectedpapers,CPM2005hadthreeinvitedpresentations, by Esko Ukkonen from the University of Helsinki, Ming Li from the University of Waterloo, and Naftali Tishby from The Hebrew University of Jerusalem.We would like to thank all Program Committee members and external r- erees for their excellent work, especially given the demanding time constraints; they gave the conference its distinctive character. We also thank all who s- mitted papers for consideration; they all contributed to the high quality of the conference. Finally, we thank the Organizing Committee members and the graduates- dents who worked hard to put in place the logistical arrangements of the c- ference. It is their dedicated contribution that made the conference possible and enjoyable.

      Produktinformation

      • Utgivningsdatum:2005-06-02
      • Mått:156 x 234 x 25 mm
      • Vikt:698 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Lecture Notes in Computer Science
      • Antal sidor:452
      • Upplaga:2005
      • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
      • ISBN:9783540262015

      Utforska kategorier

      • Informationsteknik: allmänt inom Data och IT

      Innehållsförteckning

      • Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern.- On the Longest Common Rigid Subsequence Problem.- Text Indexing with Errors.- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.- Succinct Suffix Arrays Based on Run-Length Encoding.- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.- Faster Algorithms for ?,?-Matching and Related Problems.- A Fast Algorithm for Approximate String Matching on Gene Sequences.- Approximate Matching in the L 1 Metric.- An Efficient Algorithm for Generating Super Condensed Neighborhoods.- The Median Problem for the Reversal Distance in Circular Bacterial Genomes.- Using PQ Trees for Comparative Genomics.- Hardness of Optimal Spaced Seed Design.- Weighted Directed Word Graph.- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets.- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.- DNA Compression Challenge Revisited: A Dynamic Programming Approach.- On the Complexity of Sparse Exon Assembly.- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery.- Incremental Inference of Relational Motifs with a Degenerate Alphabet.- Speeding up Parsing of Biological Context-Free Grammars.- A New Periodicity Lemma.- Two Dimensional Parameterized Matching.- An Optimal Algorithm for Online Square Detection.- A Simple Fast Hybrid Pattern-Matching Algorithm.- Prefix-Free Regular-Expression Matching.- Reducing the Size of NFAs by Using Equivalences and Preorders.- Regular Expression Constrained Sequence Alignment.- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees.- A Polynomial Time Matching Algorithmof Ordered Tree Patterns Having Height-Constrained Variables.- Assessing the Significance of Sets of Words.- Inferring a Graph from Path Frequency.- Exact and Approximation Algorithms for DNA Tag Set Design.- Parametric Analysis for Ungapped Markov Models of Evolution.- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements.- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation.- Mass Spectra Alignments and Their Significance.
      Hoppa över listan

      Du kanske också är intresserad av

      Kunsoo Park, Maxime Crochemore, Alberto Apostolico - Combinatorial Pattern Matching, E-bok

      Combinatorial Pattern Matching

      Kunsoo Park, Maxime Crochemore, Alberto Apostolico

      E-bok
      2005

      718 kr

      Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber - Combinatorial Pattern Matching, Häftad

      Combinatorial Pattern Matching

      Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber

      Häftad, 1992

      527 kr

      Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber - Combinatorial Pattern Matching, Häftad

      Combinatorial Pattern Matching

      Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber

      Häftad, 1993

      543 kr

      Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park - Algorithms and Computation, Häftad

      Algorithms and Computation

      Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park

      Häftad, 2010

      577 kr

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong - Algorithms and Computation, E-bok

      Algorithms and Computation

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong

      E-bok
      2010

      712 kr

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong - Algorithms and Computation, E-bok

      Algorithms and Computation

      Kunsoo Park, Kyung-Yong Chwa, Otfried Cheong

      E-bok
      2010

      1 148 kr

      Alberto Apostolico, Massimo Melucci - String Processing and Information Retrieval : 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings, Övrigt

      String Processing and Information Retrieval : 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings

      Alberto Apostolico, Massimo Melucci

      672 kr

      Alberto Apostolico, Massimo Melucci - String Processing and Information Retrieval, Häftad

      String Processing and Information Retrieval

      Alberto Apostolico, Massimo Melucci

      Häftad, 2004

      577 kr

      Masayuki Takeda, Alberto Apostolico - Combinatorial Pattern Matching, E-bok

      Combinatorial Pattern Matching

      Masayuki Takeda, Alberto Apostolico

      E-bok
      2003

      712 kr

      Galil Apostolico, Alberto Apostolico, Zvi Galil - Pattern Matching Algorithms, Inbunden

      Pattern Matching Algorithms

      Galil Apostolico, Alberto Apostolico, Zvi Galil

      Inbunden, 1997

      4 677 kr