Sciweavers

    BIBE
    2007
    IEEE
    174views Bioinformatics» more  BIBE 2007»
    Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
    14 years 5 months ago
    Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
    Download  webhome.cs.uvic.ca
    —We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
    Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.