Binary search algorithm

Results: 142



#Item
1Searching BWT compressed text with the Boyer-Moore algorithm and binary search Tim Bell1 Matt Powell1

Searching BWT compressed text with the Boyer-Moore algorithm and binary search Tim Bell1 Matt Powell1

Add to Reading List

Source URL: corpus.canterbury.ac.nz

Language: English - Date: 2007-07-01 21:46:18
    2Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

    Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

    Add to Reading List

    Source URL: bioinfo.ict.ac.cn

    Language: English - Date: 2014-11-28 11:05:21
    3Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-

    Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-

    Add to Reading List

    Source URL: sirocco2016.hiit.fi

    Language: English - Date: 2016-07-05 06:08:11
    4Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various Problems

    Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various Problems

    Add to Reading List

    Source URL: www.jsbi.org

    Language: English - Date: 2002-01-17 03:51:05
    5Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

    Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

    Add to Reading List

    Source URL: bioinfo.ict.ac.cn

    Language: English - Date: 2014-11-28 11:05:21
    6On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong  ??2

    On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong ??2

    Add to Reading List

    Source URL: cgi.csc.liv.ac.uk

    Language: English - Date: 2009-06-10 05:42:48
    7Semi-Automated Debugging via Binary Search through a Process Lifetime Kapil Arya ∗ Tyler Denniston∗

    Semi-Automated Debugging via Binary Search through a Process Lifetime Kapil Arya ∗ Tyler Denniston∗

    Add to Reading List

    Source URL: www.ccs.neu.edu

    Language: English - Date: 2013-10-18 20:51:40
    8Analysis with parallel partition 11 —  We know a pack is O(n) work, O(log n) span ¡  Based

    Analysis with parallel partition 11 —  We know a pack is O(n) work, O(log n) span ¡  Based

    Add to Reading List

    Source URL: twiki.di.uniroma1.it

    Language: English - Date: 2015-10-28 09:23:18
    9A highly scalable algorithm for the extraction of cis-regulatory regions Alexandra M. Carvalho∗ INESC-ID Rua Alves Redol, Lisboa, Portugal

    A highly scalable algorithm for the extraction of cis-regulatory regions Alexandra M. Carvalho∗ INESC-ID Rua Alves Redol, Lisboa, Portugal

    Add to Reading List

    Source URL: pbil.univ-lyon1.fr

    Language: English - Date: 2008-10-22 02:35:21
    101  Efficient Distributed Algorithms For Structured Optimization Problems João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel

    1 Efficient Distributed Algorithms For Structured Optimization Problems João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel

    Add to Reading List

    Source URL: www.ee.ucl.ac.uk

    Language: English - Date: 2013-07-05 07:45:59