bicycle1885

"""
Nelder-Mead algorithm

    nelder_mead(f, x0, n)

Arguments
---------

*  `f`: target function to optimize
* `x0`: initial value

bicycle1885

using Bio.Seq


# Utils for Benchmark
# -------------------

function random_seq(n, nts, probs)
    cumprobs = cumsum(probs)
    x = Array(Char, n)
    for i in 1:n

bicycle1885

using Bio.Seq

let
    str = "ACGT"^10000
    seq = DNASequence(str)
    seq′ = DNASequence("AAA" * str)[4:end]
    @assert hash(seq) === hash(seq′)

    println("ASCIIString")
    hash(str)

bicycle1885

# Approximate String Search
# =========================
#
# Myers, Gene. "A fast bit-vector algorithm for approximate string matching
# based on dynamic programming." Journal of the ACM (JACM) 46.3 (1999): 395-415.
#

"""
    approx_search(text, query, k)

bicycle1885

# Toy Regular Expression Engine Written in Julia
# ==============================================

# Example
# -------
#
# julia> include("re.jl")
# run (generic function with 1 method)
# 
# julia> ast = parse("foo*|ba*r")

bicycle1885

type PhyNode{I,T<:Tuple}
    id::I
    metadata::T
    children::Vector{PhyNode{I,T}}
    parent::PhyNode{I,T}

    # root
    function PhyNode(id, metadata, children)
        node = new(id, metadata, children)
        node.parent = node

bicycle1885

bicycle1885

bicycle1885

# Nested Containment List
# =======================
#
# Alekseyenko, A. V., & Lee, C. J. (2007). "Nested Containment List (NCList): A
# new algorithm for accelerating interval query of genome alignment and interval
# databases." Bioinformatics, 23(11), 1386–1393.
# doi:10.1093/bioinformatics/btl647

# An interval type (inclusive).
immutable Interval{T}

bicycle1885