Sciweavers

    2 search results - page 1 / 1
    » A BSP CGM Algorithm for Finding All Maximal Contiguous Subse...
    Sort
    View
    EUROPAR
    2006
    Springer
    121views Distributed And Parallel Com...» more  EUROPAR 2006»
    A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers
    15 years 6 months ago
    A BSP/CGM Algorithm for Finding All Maximal Contiguous Subsequences of a Sequence of Numbers
    Download  www.ime.usp.br
    Carlos E. R. Alves, Edson Norberto Cáceres,...
    claim paper
    Read More »
    ALMOB
    2006
    89views more  ALMOB 2006»
    On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
    15 years 2 months ago
    On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
    Download  www.almob.org
    Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
    Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.