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

Source URL: corpus.canterbury.ac.nz

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

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Geometry
• Computer science
• Search algorithms
• Discrete geometry
• Computational geometry
• Mathematical optimization
• Closest pair of points problem
• Nearest neighbor search
• Nearest neighbor graph
• K-nearest neighbors algorithm
• Euclidean minimum spanning tree

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-

Source URL: sirocco2016.hiit.fi

• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Binary trees
• Mathematics
• Computer programming
• Applied mathematics
• Probability
• With high probability
• A* search algorithm
• Rope

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

Source URL: www.jsbi.org

• Computing
• String computer science)
• Computer programming
• Arrays
• LCP array
• Suffix array
• String searching algorithm
• Binary search algorithm
• Approximate string matching
• FM-index
• Trie
• Array data type

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

Source URL: bioinfo.ict.ac.cn

• Search algorithms
• Graph theory
• Data structures
• Information science
• Information retrieval
• Disjoint-set data structure
• Binary trees
• Minimum spanning tree
• Routing algorithms
• Link/cut tree
• HeldKarp algorithm

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

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

• Graph theory
• Mathematics
• Computational complexity theory
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Matching
• Randomized algorithm
• A* search algorithm
• Bipartite graph
• HopcroftKarp algorithm
• Threaded binary tree

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

Source URL: www.ccs.neu.edu

• Software
• Computer programming
• Debuggers
• Debugging
• Cross-platform software
• GNU Debugger
• RR
• Breakpoint
• D
• MySQL
• Segmentation fault
• Algorithm

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

Source URL: twiki.di.uniroma1.it

• Sorting algorithms
• Mathematics
• Computer programming
• Software engineering
• Quicksort
• Merge sort
• Best
• worst and average case
• Binary search algorithm
• Recursion
• Binary logarithm
• Heapsort
• Insertion sort

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

Source URL: pbil.univ-lyon1.fr

• Gene expression
• Networks
• Bioinformatics
• Suffix tree
• Binary trees
• Tree traversal
• Gene regulatory network
• R-tree
• Rope
• Algorithm
• Planted motif search
• Tree alignment

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

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

• A* search algorithm
• Combinatorial optimization
• Game artificial intelligence
• Constraint programming
• Decomposition method
• Binary decision diagram