FASTA Algorithm Distribution Over Networks
Author Information
Author(s): Erich J Baker, Lin Guan, Liu Huadong, Kosuri Ravi
Primary Institution: Baylor University
Hypothesis
Can NFU-enabled IBP logistical networking support the distribution of the FASTA algorithm over various data sources?
Conclusion
The NFU-enabled Internet Backplane Protocol effectively distributes FASTA algorithm computation over large datasets stored within a scalable network.
Supporting Evidence
- The NFU-enabled IBP framework allows for efficient data storage and computation.
- Results showed significant reductions in FASTA algorithm running time over local systems.
- The approach enables distributed collaborators to access shared storage resources.
Takeaway
This study shows that researchers can share and analyze large biological data sets more easily by using a special network that helps distribute the work.
Methodology
The study involved testing the FASTA algorithm across different systems, including local and distributed networks, to measure response times and efficiency.
Limitations
The study acknowledges potential inefficiencies in parallel FASTA algorithms due to the complexity of managing large datasets.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website