Jump to content

Srinivas Aluru: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
{{Scholia|author}}
 
(17 intermediate revisions by 12 users not shown)
Line 1: Line 1:
{{Short description|American computer scientist}}
{{Infobox scientist
{{Infobox scientist
| name = Srinivas Aluru
| name = Srinivas Aluru
| image = [[File:Srinivas Aluru 2017.png|250px]]
| image = [[File:Srinivas Aluru 2017.png|250px]]
| image_size =
| image_size =
| caption =
| caption =
| birth_date =
| birth_date =
Line 8: Line 9:
| death_date =
| death_date =
| death_place =
| death_place =
| residence = United States
| citizenship = American
| citizenship = American
| nationality =
| nationality =
Line 23: Line 23:
| religion =
| religion =
| footnotes =
| footnotes =
| thesis_title = Distribution-independent hierarchical N-body methods
| thesis_title = Distribution-independent hierarchical N-body methods
}}
}}


'''Srinivas Aluru''' is a professor in the [[Georgia Institute of Technology School of Computational Science & Engineering|School of Computational Science and Engineering]] at [[Georgia Institute of Technology]], and co-Executive Director for the Georgia Tech Interdisciplinary Research Institute in Data Engineering and Science.<ref name="ga">{{Cite web|url=https://www.cc.gatech.edu/~saluru/|title=Srinivas Aluru's Home|website=www.cc.gatech.edu|language=en|access-date=2017-12-03}}</ref><ref>{{Cite web|url=http://www.news.gatech.edu/2016/07/01/georgia-tech-meets-big-data-challenges-uniting-under-new-institute|title=Georgia Tech Meets Big Data Challenges by Uniting Under New Institute|website=www.news.gatech.edu|language=en|access-date=2017-12-03}}</ref> His main areas of research are high performance computing, data science, bioinformatics and systems biology, combinatorial methods in scientific computing, and string algorithms. Aluru is a Fellow of the [[American Association for the Advancement of Science]] (AAAS) and the [[IEEE|Institute for Electrical and Electronic Engineers]] (IEEE). He is best known for his research contributions in [[parallel algorithms]] and applications, interdisciplinary research in [[bioinformatics]] and [[computational biology]], and particularly the intersection of these two fields.<ref>{{Cite web|url=https://www.nsf.gov/news/news_summ.jsp?cntn_id=125610|title=NSF Announces Interagency Progress on Administration's Big Data Initiative {{!}} NSF - National Science Foundation|website=www.nsf.gov|language=en|access-date=2017-12-03}}</ref><ref>{{Cite web|url=https://www.nsf.gov/news/news_videos.jsp?cntn_id=129244&media_id=75300&org=NSF|title=News - Video - Srinivas Aluru of Iowa State University works at the intersection of the life sciences and big data. {{!}} NSF - National Science Foundation|website=www.nsf.gov|language=en|access-date=2017-12-03}}</ref>
'''Srinivas Aluru''' is a professor in the [[Georgia Institute of Technology School of Computational Science & Engineering|School of Computational Science and Engineering]] at [[Georgia Institute of Technology]], and co-Executive Director for the Georgia Tech Interdisciplinary Research Institute in Data Engineering and Science.<ref name="ga">{{Cite web|url=https://www.cc.gatech.edu/~saluru/|title=Srinivas Aluru's Home|website=www.cc.gatech.edu|language=en|access-date=2017-12-03}}</ref><ref>{{Cite web|url=http://www.news.gatech.edu/2016/07/01/georgia-tech-meets-big-data-challenges-uniting-under-new-institute|title=Georgia Tech Meets Big Data Challenges by Uniting Under New Institute|website=www.news.gatech.edu|language=en|access-date=2017-12-03}}</ref> His main areas of research are high performance computing, data science, bioinformatics and systems biology, combinatorial methods in scientific computing, and string algorithms. Aluru is a Fellow of the [[American Association for the Advancement of Science]] (AAAS) and the [[IEEE|Institute for Electrical and Electronic Engineers]] (IEEE). He is best known for his research contributions in [[parallel algorithms]] and applications, interdisciplinary research in [[bioinformatics]] and [[computational biology]], and particularly the intersection of these two fields.<ref>{{Cite web|url=https://www.nsf.gov/news/news_summ.jsp?cntn_id=125610|title=NSF Announces Interagency Progress on Administration's Big Data Initiative {{!}} NSF - National Science Foundation|website=www.nsf.gov|language=en|access-date=2017-12-03}}</ref><ref>{{Cite web|url=https://www.nsf.gov/news/news_videos.jsp?cntn_id=129244&media_id=75300&org=NSF|title=News - Video - Srinivas Aluru of Iowa State University works at the intersection of the life sciences and big data. {{!}} NSF - National Science Foundation|website=www.nsf.gov|language=en|access-date=2017-12-03}}</ref>

His son, Chaitanya Aluru, is a computational biologist at Princeton University.


==Education==
==Education==
Aluru completed his B.S. in Computer Science at the [[Indian Institute of Technology Madras]] in the year 1989. He then received M.S. and Ph.D. degrees in Computer Science in 1991 and 1994, both from [[Iowa State University]]. His doctoral thesis was "Distribution-independent hierarchical N-body methods”.<ref name="ga"/>
Aluru completed his B.Tech in computer science at the [[Indian Institute of Technology Madras]] in the year 1989. He then received M.S. and Ph.D. degrees in computer science in 1991 and 1994, both from [[Iowa State University]]. His doctoral thesis was "Distribution-independent hierarchical N-body methods”.<ref name="ga"/>


==Career and research==
==Career and research==
Aluru began his career in 1991 as a research assistant at [[Ames Laboratory]]. After earning Ph.D., he briefly worked at [[Syracuse University]] as a visiting assistant professor before joining as an Assistant Professor in the Dept. of Computer Science at [[New Mexico State University]]. In 1999, he returned to his alma mater to serve as a faculty member in the Electrical and Computer Engineering Department. At Iowa State, he held Stanley Chair in Interdisciplinary Engineering (2006-2009) and the Mehl Professorship (2009-2013). He chaired the interdepartmental bioinformatics program (2005-2007) and served as associate chair for research and graduate education in the ECE department (2003-2006). He won several university research awards including early career, mid-career, and outstanding research achievement awards, and led research in high performance computing and bioinformatics. In 2013, he shifted to the School of [[Georgia Institute of Technology|Computational Science and Engineering at Georgia Institute of Technology]].<ref name="ga" />
Aluru began his career in 1991 as a research assistant at [[Ames Laboratory]]. After earning Ph.D., he briefly worked at [[Syracuse University]] as a visiting assistant professor before joining as an assistant professor in the Dept. of Computer Science at [[New Mexico State University]]. In 1999, he returned to his alma mater to serve as a faculty member in the Electrical and Computer Engineering Department. At Iowa State, he held Stanley Chair in Interdisciplinary Engineering (2006–2009) and the Mehl Professorship (2009–2013). He chaired the interdepartmental bioinformatics program (2005–2007) and served as associate chair for research and graduate education in the ECE department (2003–2006). He won several university research awards including early career, mid-career, and outstanding research achievement awards, and led research in high performance computing and bioinformatics. In 2013, he shifted to the School of [[Georgia Institute of Technology|Computational Science and Engineering at Georgia Institute of Technology]].<ref name="ga" />


Aluru’s research focus has centered around contributions to [[parallel algorithms]] and bioinformatics, particularly [[genomics]]. He pioneered the development of parallel methods in computational biology, and development of algorithms and software for high-throughput DNA sequencing analysis and its applications. In this context, some of his group’s work led to the development of fundamental string algorithms, particularly for constructing suffix arrays and algorithms for approximate sequence matching. He also solved the open problem of computing string edit distance or biological sequence alignments in optimal time and space. He collaborated with domain scientists on several high impact projects, including sequencing of the maize genome, finding novel genes in maize, and uncovering genetic mechanisms that underlie growth and drought response in plants.<ref>{{Cite news|url=https://phys.org/news/2017-02-genetic-mechanisms-growth-drought-response.html|title=Researchers detail genetic mechanisms that govern growth and drought response in plants|access-date=2017-12-03}}</ref>
Aluru's research focus has centered around contributions to [[parallel algorithms]] and bioinformatics, particularly [[genomics]]. He pioneered the development of parallel methods in computational biology, and development of algorithms and software for high-throughput DNA sequencing analysis and its applications. In this context, some of his group's work led to the development of fundamental string algorithms, particularly for constructing suffix arrays and algorithms for approximate sequence matching. He also solved the open problem of computing string edit distance or biological sequence alignments in optimal time and space. He collaborated with domain scientists on several high impact projects, including sequencing of the maize genome, finding novel genes in maize, and uncovering genetic mechanisms that underlie growth and drought response in plants.<ref>{{Cite news|url=https://phys.org/news/2017-02-genetic-mechanisms-growth-drought-response.html|title=Researchers detail genetic mechanisms that govern growth and drought response in plants|access-date=2017-12-03}}</ref>


An early pioneer in big data, Aluru led one of the eight inaugural mid-scale NSF-NIH Big Data projects awarded in the first round of federal big data investments in 2012. He has contributed to NITRD and OSTP led white house workshops, and NSF and DOE led efforts to create and nurture big data research. He led the efforts to create the NSF South Big Data Regional Innovation Hub,<ref>{{Cite web|url=https://www.cc.gatech.edu/georgia-tech-and-uncs-renci-lead-major-effort-applies-big-data-solutions-regional-challenges|title=Georgia Tech and UNC's RENCI to Lead Major Effort that Applies Big Data Solutions to Regional Challenges {{!}} College of Computing|website=www.cc.gatech.edu|language=en|access-date=2017-12-03}}</ref> that nurtures big data partnerships between organizations in the 16 U.S. Southern States and [[Washington, D.C.]].
An early pioneer in big data, Aluru led one of the eight inaugural mid-scale NSF-NIH Big Data projects awarded in the first round of federal big data investments in 2012. He has contributed to NITRD and OSTP led white house workshops, and NSF and DOE led efforts to create and nurture big data research. He led the efforts to create the NSF South Big Data Regional Innovation Hub,<ref>{{Cite web|url=https://www.cc.gatech.edu/georgia-tech-and-uncs-renci-lead-major-effort-applies-big-data-solutions-regional-challenges|title=Georgia Tech and UNC's RENCI to Lead Major Effort that Applies Big Data Solutions to Regional Challenges {{!}} College of Computing|website=www.cc.gatech.edu|language=en|access-date=2017-12-03}}</ref> that nurtures big data partnerships between organizations in the 16 U.S. Southern States and [[Washington, D.C.]]


==Awards==
==Awards==
Line 45: Line 43:


==Selected publications==
==Selected publications==
* {{Cite journal|last=Schnable|first=Patrick S.|last2=Ware|first2=Doreen|last3=Fulton|first3=Robert S.|last4=Stein|first4=Joshua C.|last5=Wei|first5=Fusheng|last6=Pasternak|first6=Shiran|last7=Liang|first7=Chengzhi|last8=Zhang|first8=Jianwei|last9=Fulton|first9=Lucinda|date=2009-11-20|title=The B73 Maize Genome: Complexity, Diversity, and Dynamics|url=http://science.sciencemag.org/content/326/5956/1112|journal=Science|language=en|volume=326|issue=5956|pages=1112–1115|doi=10.1126/science.1178534|issn=0036-8075|pmid=19965430}}
* {{Cite journal|last1=Schnable|first1=Patrick S.|last2=Ware|first2=Doreen|last3=Fulton|first3=Robert S.|last4=Stein|first4=Joshua C.|last5=Wei|first5=Fusheng|last6=Pasternak|first6=Shiran|last7=Liang|first7=Chengzhi|last8=Zhang|first8=Jianwei|last9=Fulton|first9=Lucinda|date=2009-11-20|title=The B73 Maize Genome: Complexity, Diversity, and Dynamics|journal=Science|language=en|volume=326|issue=5956|pages=1112–1115|doi=10.1126/science.1178534|issn=0036-8075|pmid=19965430|url=https://dr.lib.iastate.edu/bitstreams/deb93473-1f37-4179-9c23-14c9efe2ec9e/download|bibcode=2009Sci...326.1112S|s2cid=21433160}}
* {{Cite book|last=Ko|first=Pang|last2=Aluru|first2=Srinivas|date=2003-06-25|title=Space Efficient Linear Time Construction of Suffix Arrays|journal=Combinatorial Pattern Matching|series=Lecture Notes in Computer Science|language=en|publisher=Springer, Berlin, Heidelberg|pages=200–210|doi=10.1007/3-540-44888-8_15|isbn=978-3540448884}}
* {{Cite book|last1=Ko|first1=Pang|last2=Aluru|first2=Srinivas|title=Combinatorial Pattern Matching |chapter=Space Efficient Linear Time Construction of Suffix Arrays |date=2003-06-25|series=Lecture Notes in Computer Science|volume=2676 |language=en|publisher=Springer, Berlin, Heidelberg|pages=200–210|doi=10.1007/3-540-44888-8_15|isbn=978-3540448884}}
* {{Cite journal|last=Huang|first=Xiaoqiu|last2=Wang|first2=Jianmin|last3=Aluru|first3=Srinivas|last4=Yang|first4=Shiaw-Pyng|last5=Hillier|first5=LaDeana|date=2003-09-01|title=PCAP: A Whole-Genome Assembly Program|url=http://genome.cshlp.org/content/13/9/2164|journal=Genome Research|language=en|volume=13|issue=9|pages=2164–2170|doi=10.1101/gr.1390403|issn=1088-9051|pmid=12952883|pmc=403719}}
* {{Cite journal|last1=Huang|first1=Xiaoqiu|last2=Wang|first2=Jianmin|last3=Aluru|first3=Srinivas|last4=Yang|first4=Shiaw-Pyng|last5=Hillier|first5=LaDeana|date=2003-09-01|title=PCAP: A Whole-Genome Assembly Program|journal=Genome Research|language=en|volume=13|issue=9|pages=2164–2170|doi=10.1101/gr.1390403|issn=1088-9051|pmid=12952883|pmc=403719}}
* {{Cite book|last=Kim|first=Dong Kyue|last2=Sim|first2=Jeong Seop|last3=Park|first3=Heejin|last4=Park|first4=Kunsoo|date=2003-06-25|title=Linear-Time Construction of Suffix Arrays|journal=Combinatorial Pattern Matching|series=Lecture Notes in Computer Science|language=en|publisher=Springer, Berlin, Heidelberg|pages=186–199|doi=10.1007/3-540-44888-8_14|isbn=978-3540448884|citeseerx=10.1.1.458.3655}}
* {{Cite book|last1=Kim|first1=Dong Kyue|last2=Sim|first2=Jeong Seop|last3=Park|first3=Heejin|last4=Park|first4=Kunsoo|title=Combinatorial Pattern Matching |chapter=Linear-Time Construction of Suffix Arrays |date=2003-06-25|series=Lecture Notes in Computer Science|volume=2676 |language=en|publisher=Springer, Berlin, Heidelberg|pages=186–199|doi=10.1007/3-540-44888-8_14|isbn=978-3540448884|citeseerx=10.1.1.458.3655}}
* {{Cite journal|last=Yu|first=Xiaofei|last2=Li|first2=Lei|last3=Zola|first3=Jaroslaw|last4=Aluru|first4=Maneesha|last5=Ye|first5=Huaxun|last6=Foudree|first6=Andrew|last7=Guo|first7=Hongqing|last8=Anderson|first8=Sarah|last9=Aluru|first9=Srinivas|date=2011-02-01|title=A brassinosteroid transcriptional network revealed by genome-wide identification of BESI target genes in Arabidopsis thaliana|journal=The Plant Journal|language=en|volume=65|issue=4|pages=634–646|doi=10.1111/j.1365-313X.2010.04449.x|pmid=21214652|issn=1365-313X}}
* {{Cite journal|last1=Yu|first1=Xiaofei|last2=Li|first2=Lei|last3=Zola|first3=Jaroslaw|last4=Aluru|first4=Maneesha|last5=Ye|first5=Huaxun|last6=Foudree|first6=Andrew|last7=Guo|first7=Hongqing|last8=Anderson|first8=Sarah|last9=Aluru|first9=Srinivas|date=2011-02-01|title=A brassinosteroid transcriptional network revealed by genome-wide identification of BESI target genes in Arabidopsis thaliana|journal=The Plant Journal|language=en|volume=65|issue=4|pages=634–646|doi=10.1111/j.1365-313X.2010.04449.x|pmid=21214652|issn=1365-313X}}
* {{Cite book|url=https://books.google.com/?id=3Ss-ws2Zm6IC&pg=PP1&dq=info:it-Sqszb2fgJ:scholar.google.com|title=Handbook of Computational Molecular Biology|last=Aluru|first=Srinivas|date=2005-12-21|publisher=CRC Press|isbn=9781420036275|language=en}}
* {{Cite book|url=https://books.google.com/books?id=3Ss-ws2Zm6IC&dq=info:it-Sqszb2fgJ:scholar.google.com&pg=PP1|title=Handbook of Computational Molecular Biology|last=Aluru|first=Srinivas|date=2005-12-21|publisher=CRC Press|isbn=9781420036275|language=en}}
* {{Cite journal|last=Yang|first=X.|last2=Chockalingam|first2=S. P.|last3=Aluru|first3=S.|date=2013-01-01|title=A survey of error-correction methods for next-generation sequencing|url=https://academic.oup.com/bib/article-abstract/14/1/56/306302|journal=Briefings in Bioinformatics|language=en|volume=14|issue=1|pages=56–66|doi=10.1093/bib/bbs015|pmid=22492192|issn=1467-5463}}
* {{Cite journal|last1=Yang|first1=X.|last2=Chockalingam|first2=S. P.|last3=Aluru|first3=S.|date=2013-01-01|title=A survey of error-correction methods for next-generation sequencing|journal=Briefings in Bioinformatics|language=en|volume=14|issue=1|pages=56–66|doi=10.1093/bib/bbs015|pmid=22492192|issn=1467-5463|doi-access=free}}
* {{Cite journal|last=Aluru|first=Srinivas|title=Space efficient linear time construction of suffix arrays|url=http://www.sciencedirect.com/science/article/pii/S1570866704000498|journal=Journal of Discrete Algorithms|volume=3|issue=2–4|pages=143–156|via=|doi=10.1016/j.jda.2004.08.002|year=2005}}
* {{Cite journal|last=Aluru|first=Srinivas|title=Space efficient linear time construction of suffix arrays|journal=Journal of Discrete Algorithms|volume=3|issue=2–4|pages=143–156|doi=10.1016/j.jda.2004.08.002|year=2005|doi-access=free}}
* {{Cite journal|last=Yang|first=X.|last2=Dorman|first2=K. S.|last3=Aluru|first3=S.|date=2010-10-15|title=Reptile: representative tiling for short read error correction|url=https://academic.oup.com/bioinformatics/article-abstract/26/20/2526/193714|journal=Bioinformatics|language=en|volume=26|issue=20|pages=2526–2533|doi=10.1093/bioinformatics/btq468|pmid=20834037|issn=1367-4803}}
* {{Cite journal|last1=Yang|first1=X.|last2=Dorman|first2=K. S.|last3=Aluru|first3=S.|date=2010-10-15|title=Reptile: representative tiling for short read error correction|journal=Bioinformatics|language=en|volume=26|issue=20|pages=2526–2533|doi=10.1093/bioinformatics/btq468|pmid=20834037|issn=1367-4803|doi-access=free}}
* {{Cite book|last=Ott|first=Michael|last2=Zola|first2=Jaroslaw|last3=Stamatakis|first3=Alexandros|last4=Aluru|first4=Srinivas|date=2007|title=Large-scale Maximum Likelihood-based Phylogenetic Analysis on the IBM BlueGene/L|journal=Proceedings of the 2007 ACM/IEEE Conference on Supercomputing|series=SC '07|location=New York, NY, USA|publisher=ACM|pages=4:1–4:11|doi=10.1145/1362622.1362628|isbn=9781595937643}}
* {{Cite book |doi=10.1145/1362622.1362628|isbn=9781595937643|chapter=Large-scale maximum likelihood-based phylogenetic analysis on the IBM Blue ''Gene''/L|title=Proceedings of the 2007 ACM/IEEE conference on Supercomputing - SC '07|pages=1|year=2007|last1=Ott|first1=Michael|last2=Zola|first2=Jaroslaw|last3=Stamatakis|first3=Alexandros|last4=Aluru|first4=Srinivas|s2cid=16113442}}
* {{Cite journal|last=Kalyanaraman|first=A.|date=2003-06-01|title=Efficient clustering of large EST data sets on parallel computers|url=https://academic.oup.com/nar/article-abstract/31/11/2963/1220322|journal=Nucleic Acids Research|language=en|volume=31|issue=11|pages=2963–2974|doi=10.1093/nar/gkg379|issn=0305-1048}}
* {{Cite journal|last=Kalyanaraman|first=A.|date=2003-06-01|title=Efficient clustering of large EST data sets on parallel computers|journal=Nucleic Acids Research|language=en|volume=31|issue=11|pages=2963–2974|doi=10.1093/nar/gkg379|pmid=12771222|pmc=156714|issn=0305-1048}}
* {{Cite journal|last=Rajko|first=S.|last2=Aluru|first2=S.|date=December 2004|title=Space and time optimal parallel sequence alignments|url=http://ieeexplore.ieee.org/abstract/document/1353240/|journal=IEEE Transactions on Parallel and Distributed Systems|volume=15|issue=12|pages=1070–1081|doi=10.1109/TPDS.2004.86|issn=1045-9219}}
* {{Cite journal|last1=Rajko|first1=S.|last2=Aluru|first2=S.|date=December 2004|title=Space and time optimal parallel sequence alignments|journal=IEEE Transactions on Parallel and Distributed Systems|volume=15|issue=12|pages=1070–1081|doi=10.1109/TPDS.2004.86|s2cid=1183248|issn=1045-9219|url=https://dr.lib.iastate.edu/bitstreams/62075071-0df8-4f49-a57c-1c7e48f28b98/download}}


==References==
==References==
Line 68: Line 66:
[[Category:Living people]]
[[Category:Living people]]
[[Category:Fellows of the American Association for the Advancement of Science]]
[[Category:Fellows of the American Association for the Advancement of Science]]
[[Category:Georgia Institute of Technology faculty]]
[[Category:Georgia Tech faculty]]
[[Category:Fellow Members of the IEEE]]
[[Category:Fellows of the IEEE]]

Latest revision as of 23:08, 1 May 2024

Srinivas Aluru
CitizenshipAmerican
Alma materIowa State University
AwardsJohn V. Atanasoff Discovery Award (2017)
IEEE Fellow (2010)
AAAS Fellow (2010)
Swarnajayanti Fellowship (2007-2012)
IEEE Computer Society Golden Core
IEEE Computer Society Meritorious Service
NSF Career (1997)
Scientific career
FieldsHigh performance computing, data science, bioinformatics, scientific computing, string algorithms
InstitutionsIowa State University
Georgia Institute of Technology
Thesis Distribution-independent hierarchical N-body methods
Doctoral advisorJohn Gustafson, G.M. Prabhu

Srinivas Aluru is a professor in the School of Computational Science and Engineering at Georgia Institute of Technology, and co-Executive Director for the Georgia Tech Interdisciplinary Research Institute in Data Engineering and Science.[1][2] His main areas of research are high performance computing, data science, bioinformatics and systems biology, combinatorial methods in scientific computing, and string algorithms. Aluru is a Fellow of the American Association for the Advancement of Science (AAAS) and the Institute for Electrical and Electronic Engineers (IEEE). He is best known for his research contributions in parallel algorithms and applications, interdisciplinary research in bioinformatics and computational biology, and particularly the intersection of these two fields.[3][4]

Education

[edit]

Aluru completed his B.Tech in computer science at the Indian Institute of Technology Madras in the year 1989. He then received M.S. and Ph.D. degrees in computer science in 1991 and 1994, both from Iowa State University. His doctoral thesis was "Distribution-independent hierarchical N-body methods”.[1]

Career and research

[edit]

Aluru began his career in 1991 as a research assistant at Ames Laboratory. After earning Ph.D., he briefly worked at Syracuse University as a visiting assistant professor before joining as an assistant professor in the Dept. of Computer Science at New Mexico State University. In 1999, he returned to his alma mater to serve as a faculty member in the Electrical and Computer Engineering Department. At Iowa State, he held Stanley Chair in Interdisciplinary Engineering (2006–2009) and the Mehl Professorship (2009–2013). He chaired the interdepartmental bioinformatics program (2005–2007) and served as associate chair for research and graduate education in the ECE department (2003–2006). He won several university research awards including early career, mid-career, and outstanding research achievement awards, and led research in high performance computing and bioinformatics. In 2013, he shifted to the School of Computational Science and Engineering at Georgia Institute of Technology.[1]

Aluru's research focus has centered around contributions to parallel algorithms and bioinformatics, particularly genomics. He pioneered the development of parallel methods in computational biology, and development of algorithms and software for high-throughput DNA sequencing analysis and its applications. In this context, some of his group's work led to the development of fundamental string algorithms, particularly for constructing suffix arrays and algorithms for approximate sequence matching. He also solved the open problem of computing string edit distance or biological sequence alignments in optimal time and space. He collaborated with domain scientists on several high impact projects, including sequencing of the maize genome, finding novel genes in maize, and uncovering genetic mechanisms that underlie growth and drought response in plants.[5]

An early pioneer in big data, Aluru led one of the eight inaugural mid-scale NSF-NIH Big Data projects awarded in the first round of federal big data investments in 2012. He has contributed to NITRD and OSTP led white house workshops, and NSF and DOE led efforts to create and nurture big data research. He led the efforts to create the NSF South Big Data Regional Innovation Hub,[6] that nurtures big data partnerships between organizations in the 16 U.S. Southern States and Washington, D.C.

Awards

[edit]
  • Fellow, American Association for the Advancement of Science[7]
  • Fellow, Institute for Electrical and Electronics Engineers (IEEE) and IEEE Computer Society[1]

Selected publications

[edit]
  • Schnable, Patrick S.; Ware, Doreen; Fulton, Robert S.; Stein, Joshua C.; Wei, Fusheng; Pasternak, Shiran; Liang, Chengzhi; Zhang, Jianwei; Fulton, Lucinda (2009-11-20). "The B73 Maize Genome: Complexity, Diversity, and Dynamics". Science. 326 (5956): 1112–1115. Bibcode:2009Sci...326.1112S. doi:10.1126/science.1178534. ISSN 0036-8075. PMID 19965430. S2CID 21433160.
  • Ko, Pang; Aluru, Srinivas (2003-06-25). "Space Efficient Linear Time Construction of Suffix Arrays". Combinatorial Pattern Matching. Lecture Notes in Computer Science. Vol. 2676. Springer, Berlin, Heidelberg. pp. 200–210. doi:10.1007/3-540-44888-8_15. ISBN 978-3540448884.
  • Huang, Xiaoqiu; Wang, Jianmin; Aluru, Srinivas; Yang, Shiaw-Pyng; Hillier, LaDeana (2003-09-01). "PCAP: A Whole-Genome Assembly Program". Genome Research. 13 (9): 2164–2170. doi:10.1101/gr.1390403. ISSN 1088-9051. PMC 403719. PMID 12952883.
  • Kim, Dong Kyue; Sim, Jeong Seop; Park, Heejin; Park, Kunsoo (2003-06-25). "Linear-Time Construction of Suffix Arrays". Combinatorial Pattern Matching. Lecture Notes in Computer Science. Vol. 2676. Springer, Berlin, Heidelberg. pp. 186–199. CiteSeerX 10.1.1.458.3655. doi:10.1007/3-540-44888-8_14. ISBN 978-3540448884.
  • Yu, Xiaofei; Li, Lei; Zola, Jaroslaw; Aluru, Maneesha; Ye, Huaxun; Foudree, Andrew; Guo, Hongqing; Anderson, Sarah; Aluru, Srinivas (2011-02-01). "A brassinosteroid transcriptional network revealed by genome-wide identification of BESI target genes in Arabidopsis thaliana". The Plant Journal. 65 (4): 634–646. doi:10.1111/j.1365-313X.2010.04449.x. ISSN 1365-313X. PMID 21214652.
  • Aluru, Srinivas (2005-12-21). Handbook of Computational Molecular Biology. CRC Press. ISBN 9781420036275.
  • Yang, X.; Chockalingam, S. P.; Aluru, S. (2013-01-01). "A survey of error-correction methods for next-generation sequencing". Briefings in Bioinformatics. 14 (1): 56–66. doi:10.1093/bib/bbs015. ISSN 1467-5463. PMID 22492192.
  • Aluru, Srinivas (2005). "Space efficient linear time construction of suffix arrays". Journal of Discrete Algorithms. 3 (2–4): 143–156. doi:10.1016/j.jda.2004.08.002.
  • Yang, X.; Dorman, K. S.; Aluru, S. (2010-10-15). "Reptile: representative tiling for short read error correction". Bioinformatics. 26 (20): 2526–2533. doi:10.1093/bioinformatics/btq468. ISSN 1367-4803. PMID 20834037.
  • Ott, Michael; Zola, Jaroslaw; Stamatakis, Alexandros; Aluru, Srinivas (2007). "Large-scale maximum likelihood-based phylogenetic analysis on the IBM Blue Gene/L". Proceedings of the 2007 ACM/IEEE conference on Supercomputing - SC '07. p. 1. doi:10.1145/1362622.1362628. ISBN 9781595937643. S2CID 16113442.
  • Kalyanaraman, A. (2003-06-01). "Efficient clustering of large EST data sets on parallel computers". Nucleic Acids Research. 31 (11): 2963–2974. doi:10.1093/nar/gkg379. ISSN 0305-1048. PMC 156714. PMID 12771222.
  • Rajko, S.; Aluru, S. (December 2004). "Space and time optimal parallel sequence alignments". IEEE Transactions on Parallel and Distributed Systems. 15 (12): 1070–1081. doi:10.1109/TPDS.2004.86. ISSN 1045-9219. S2CID 1183248.

References

[edit]