๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Algorithms and Computation Volume 650 || The longest common subsequence problem for small alphabet size between many strings

โœ Scribed by Ibaraki, Toshihide; Inagaki, Yasuyoshi; Iwama, Kazuo; Nishizeki, Takao; Yamashita, Masafumi

Book ID
118040758
Publisher
Springer Berlin Heidelberg
Year
1992
Weight
541 KB
Category
Article
ISBN
354047501X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Stri
[Lecture Notes in Computer Science] String Processing and Information Retrieval Volume 3772 || Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem
โœ Consens, Mariano; Navarro, Gonzalo ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 287 KB

This Book Constitutes The Refereed Proceedings Of The 12th International Conference On String Processing And Information Retrieval, Spire 2005, Held In Buenos Aires, Argentina In November 2005. The 27 Revised Full Papers And 17 Revised Short Papers Presented Were Carefully Reviewed And Selected From

[Lecture Notes in Computer Science] SOFS
[Lecture Notes in Computer Science] SOFSEM 2010: Theory and Practice of Computer Science Volume 5901 || Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem
โœ van Leeuwen, Jan; Muscholl, Anca; Peleg, David; Pokornรฝ, Jaroslav; Rumpe, Bernha ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 229 KB

This Book Constitutes The Refereed Proceedings Of The 36th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2010, Held In ล pindleruv Mlรฝn, Czech Republic, In January 2009. The 53 Revised Full Papers, Presented Together With 11 Invited Contributions, Were Carefully Revi