Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Polynomial Time Solvable Formulation of Multiple Sequence Alignment


    Beteiligte:
    Sze, S.-H. (Autor:in) / Lu, Y. (Autor:in) / Yang, Q. (Autor:in) / Miyano, Satoru

    Kongress:

    Annual international conference; 9th, Research in computational molecular biology: 9th annual international conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005 : proceedings ; 2005 ; Cambridge, MA



    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    13 pages


    Anmerkungen:

    Conference proceedings. Includes bibliographical references and index.




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    A Restricted Reachability Problem of Petri Nets Solvable in Pseudo-Polynomial Time

    Takahashi, K. / Nakamura, K. / Ichikawa, A. | British Library Online Contents | 1993


    Impact Time Control with Generalized-Polynomial Range Formulation

    Tekin, Raziye / Erer, Koray S. / Holzapfel, Florian | AIAA | 2017


    Polynomial-Time Carsharing Optimization: Linear Formulation and Large-Scale Simulations

    Monteiro, Cristiano Martins / Davis, Clodoveu A. | IEEE | 2023


    Linear Sequence-to-Sequence Alignment

    Carceroni, R. / Padua, F. / Santos, G. et al. | British Library Conference Proceedings | 2004


    Linear sequence-to-sequence alignment

    Carceroni, R.L. / Padua, F.L.C. / Santos, G.A.M.R. et al. | IEEE | 2004