References

1. B Jackson, S Aluru, and P Schnable. Consensus Genetic Maps: A Graph Theoretic Approach. Proceedings of the 4th Annual Computational Systems Bioinformatics Conference. 35- 45, 2005.
2. B Jackson, P Schnable, and S Aluru. Consensus Genetic Maps as Median Orders from Inconsistent Sources. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 5(1), 161-171, 2008.
3. B Jackson and S Aluru. Parallel Construction of Bidirected Graphs for Genome Assembly. Proceedings of the 37th Annual International Conference on Parallel Processing. 346- 353, 2008.
4. B Jackson, P Schnable, and S Aluru. Parallel Short Sequence Assembly of Transcriptomes. 7th Annual Asia-Pacific Bioinformatics Conference. To appear: January, 2009.
5. B Jackson, P Schnable, and S Aluru. Assembly of Large Eukaryotic Genomes from Paired Short Reads. 1st Annual International Conference on Bioinformatics and Computational Biology. Invited, to appear: April, 2009.
6. B Jackson, P Schnable, and S Aluru. Parallel Short Sequence Assembly of Transcriptomes. BMC Bioinformatics. 10(S1), S14, 2009.


7. A Aho, M Garey, and J Ulman. The Transitive Reduction of a Directed Graph. SIAM Journal on Computing. 1:131-137, 1972.
8. N Ailon, M Charikar, and A Newman. Aggregating Inconsistent Information: Ranking and Clustering. Proceedings of the 37th Annual ACM Symposium on the Theory of Computation. 684-693, 2005.
9. K Arrow. Social Choice and Individual Values. John Wiley, 1951.
10. J Butler, I MacCallum,MKleber, I Shlyakhter,MBelmonte, E Lander, C Nusbaum, and D Jaffe. ALL-PATHS: De novo assembly of whole-genome shotgun microreads. Genome Research. 18:810-820, 2008.
11. J Dean and S Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. Sixth Symposium on Operating System Design and Implementation. 2004.
12. R Floyd. Algorithm 97: Shortest Path. Communications of the ACM. 5:345, 1962.
13. A Goralcikova and K Koubek. A Reduct-and-Closure Algorithm for Graphs. Mathematic Foundations of Computer Science. 74: 301-307, 1979.
14. D Helman, J Ja’Ja’, and D Bader. A new deterministic parallel sorting algorithm with an experimental evaluation. Journal of Experimental Algorithms. 3:4, 1998.
15. D Hernandez, P Francois, L Farinelli, M Osteras, and J Schrenzel. De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer. Genome Research. 18:802-809, 2008.
16. O Hudrey. Computation of Median Orders: Complexity and Results. Proceedings of the DIMACS-LAMSADE Worshop on Computer Science and Decision Theory. 2004.
17. D Johnson. Finding all the Elementary Circuits in a Directed Graph. SIAM Journal on Computing. 4: 77-84, 1975.
18. J Kemeny. Mathematics without Numbers. Daedelus. 188:227-298, 1959.
19. P Medvedev and M Brudno. Ab Initio Whole Genome Shotgun Assembly with Mated Short Reads. Lecture Notes in Computer Science. 4955:50-64, 2008.
20. E Myers. The fragment assembly string graph. Bioinformatics. 21:ii79-ii85, 2005.
21. J Ott. Analysis of Human Genetic Linkage. John Hopkins University Press, 1985.
22. P Pevzner, H Tang, and M Waterman. Fragment assembly with double-barreled data. Proceedings of the National Academy of Sciences. 98(17):9748-9753, 2001.
23. R Pike et al. Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal. 13(4): 227-298, 2005.
24. J Sibeyn, F Guillaume, and T Seidel. Practical Parallel List Ranking. Journal of Parallel and Distributed Computing. 56:156-180, 1999.
25. A Sundquist, M Ronaghi, H Tang, P Pevzner, and S Batzoglou. Whole-Genome Sequencing and Assembly with High- Throughput, Short Read Technologies. PLoS ONE. 2:e484, 2007.
26. R Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing. 1(2): 146-160, 1972.
27. T Tu, C Rendleman, D Borhani et al. A Scalable Parallel Framework for Analyzing Terascale Molecular Dynamics Trajectories. Proceedings of the 2008 Supercomputing Conference. 2008.
28. H Yang, A Dasdan, R Hsiao, and D Parker. Map-reducemerge: simplified relational data processing on large clusters. Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data. 1029-1040, 2007.
29. D Zerbino and E Birney. Velvet: Algorithms for De Novo Short Read Assembly Using De Bruijn Graphs. Genome Research. 2008.