✦ LIBER ✦

Efficient motif finding algorithms for large-alphabet inputs

✍ Scribed by Pavel P Kuksa; Vladimir Pavlovic

Book ID: 114999493
Publisher: BioMed Central
Year: 2010
Tongue: English
Weight: 894 KB
Volume: 11
Category: Article
ISSN: 1471-2105
DOI: 10.1186/1471-2105-11-s8-s1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient construction of minimum-redund

Efficient construction of minimum-redundancy codes for large alphabets

✍ Moffat, A.; Turpin, A. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 273 KB

An efficient compensation-path finding a

An efficient compensation-path finding algorithm for a large-scale processor array

✍ Takao Ozawa 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 905 KB

Efficient algorithms for finding sills i

Efficient algorithms for finding sills in digital topographic maps

✍ Thomas D. Otto; Andreas M. Thurnherr 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 610 KB

Efficient algorithms for finding a longe

Efficient algorithms for finding a longest common increasing subsequence

✍ Wun-Tat Chan; Yong Zhang; Stanley P. Y. Fung; Deshi Ye; Hong Zhu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 316 KB

Efficient Hybrid Algorithms for Finding

Efficient Hybrid Algorithms for Finding Zeros of Convex Functions

✍ Florian A. Potra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 533 KB

We consider two hybrid algorithms for finding an \(\varepsilon\)-approximation of a root of a convex real function that is twice differentiable and satisfies a certain growth condition on the intervial \([0, R]\). The first algorithm combines a binary search procedure with Newton's method. The binar

An efficient scheduling algorithm for in

An efficient scheduling algorithm for input-queued switches

✍ Qingsheng Hu; Yuan Sun; Jiangtao Han 📂 Article 📅 2007 🏛 SP Science Press 🌐 English ⚖ 195 KB