✦ LIBER ✦

Finding congruent regions in parallel

✍ Scribed by Laurence Boxer

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 308 KB
Volume: 18
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90046-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for finding congrue

A parallel algorithm for finding congruent regions

✍ Z.C Shih; R.C.T Lee; S.N Yang 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 646 KB

Finding Similar Regions in Many Sequence

✍ Ming Li; Bin Ma; Lusheng Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Algorithms for finding similar, or highly conserved, regions in a group of sequences are at the core of many molecular biology problems. Assume that we are given n DNA sequences s 1 , ..., s n . The Consensus Patterns problem, which has been widely studied in bioinformatics research, in its simplest

Finding frequent items in parallel

✍ Massimo Cafaro; Piergiulio Tempesta 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

Finding Euler tours in parallel

✍ Mikhail Atallah; Uzi Vishkin 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 526 KB

Finding shape numbers in parallel

✍ Kuo-Liang Chung 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Finding maximum matching for bipartite g

Finding maximum matching for bipartite graphs in parallel

✍ Pranay Chaudhuri 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 148 KB