Back to Results
First PageMeta Content
Dynamic programming / Parallel computing / Sequence alignment / Smith–Waterman algorithm / Computer architecture / Needleman–Wunsch algorithm / Speedup / BLAST / Algorithm / Computational phylogenetics / Bioinformatics / Science


Whole genome alignments using MPI-LAGAN Ruinan Zhang, Huzefa Rangwala and George Karypis Department of Computer Science & Engineering, University of Minnesota Minneapolis, MN[removed]removed], [removed],
Add to Reading List

Document Date: 2012-08-16 12:29:06

Open Document

File Size: 192,53 KB

Share Result on Facebook

City

Rochester / Redwood City / /

Company

IBM / 3M / Intel / Adison Wesley Publishing Company / /

Currency

pence / /

/

Facility

Minnesota Supercomputing Institute / University of Minnesota / University of Minnesota Minneapolis / /

IndustryTerm

parallel dynamic programming algorithm / protein database search programs / serial algorithm / parallel algorithms / dynamic programming solution / maximal chains / finished processing / parallel whole genome alignment algorithm / memory efficient algorithms / sequence alignment algorithms / dynamic programming algorithm / final maximal scoring chain / dynamic-programming-based alignment algorithms / blast-like alignment tool / Alignment algorithms / Anchor-based alignment algorithms / Basic local alignment search tool / recursive algorithm / 950MHz processor / open software / parallel solutions / Sequence database search algorithms / Local alignment algorithms / sparse dynamic programming solution / smith-waterman algorithm / shared-memory processors / parallel algorithm / dual core processor / anchor-based algorithm / search space / alignment algorithm / /

MusicGroup

EF / /

OperatingSystem

Xp / Linux / /

Organization

National Institute of Health / National Science Foundation / University of Minnesota Minneapolis / MPI-LAGAN Ruinan Zhang / Huzefa Rangwala and George Karypis Department of Computer Science & Engineering / Minnesota Supercomputing Institute / University of Minnesota / /

Person

Berthold Gottgens / Ananth Grama / Arend Sidow / Eric D. Green / David Lipman / Ai / Eugene Davydov / Serafim Batzoglou / George Karypis / Warren Gish / Gregory M. Cooper / Burkhard Morgenstern / Vipin Kumar / Serafim Batzogluo / Michael F. Kim / Stephen Altschul / Eugene Myers / Anshul Gupta / Michael Brudno / Michael Chapman / Webb Miller / /

/

Position

D. J. / /

Product

Galil / Linux / /

ProgrammingLanguage

C / L / /

ProvinceOrState

Minnesota / California / /

PublishedMedium

Journal of Molecular Biology / Genome Research / Nucleic Acids Research / /

Technology

sparse LIS algorithm / genomics / LIS algorithm / Bioinformatics / genome alignment algorithm / parallel LIS algorithm / Linux / two processors / Local alignment algorithms / serial CHAOS algorithm / parallel algorithm / CHAOS algorithm / serial algorithm / Alignment algorithms / Work The MPI-LAGAN algorithm / sequence alignment algorithms / smith-waterman algorithm / shared memory / recursive algorithm / human genome / serial LAGAN algorithm / CHAOS algorithms / shared-memory processors / Pairwise algorithms / 16 processors / serial LIS algorithm / 3 Serial LAGAN Algorithm / one processor / LIS algorithms / load balancing / Sanger technology / MPI protocol / dynamic-programming-based alignment algorithms / alignment algorithm / MPI-based protocol / anchor-based algorithm / DNA sequencing / 64 GB Sun-Sparc 950MHz processor / chaining algorithm / dynamic programming algorithm / Opteron processor / MUMMER algorithm / 4 Parallel LAGAN Algorithm / parallel dynamic programming algorithm / Anchor-based alignment algorithms / Sequence database search algorithms / LAGAN algorithm / done using the MPI protocol / /

SocialTag