Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

book chapter · Lecture notes in computer science · 2011

Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters

Trong Dao Le, Melvin Zhang, Wai Yie Leong

Cited by 1Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

Le, T. D., Zhang, M., & Leong, W. Y. (2011). Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters. Lecture notes in computer science, 275–286. https://doi.org/10.1007/978-3-642-21204-8_30

MLA 9

Le, Trong Dao, et al. “Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters.” Lecture notes in computer science, 2011, pp. 275–86, https://doi.org/10.1007/978-3-642-21204-8_30.

Chicago

Le, Trong Dao, Melvin Zhang, and Wai Yie Leong. 2011. “Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters.” Lecture notes in computer science: 275–86. https://doi.org/10.1007/978-3-642-21204-8_30.

Harvard

Le, T.D., Zhang, M. and Leong, W.Y. (2011) ‘Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters’, Lecture notes in computer science, pp. 275–286. Available at: https://doi.org/10.1007/978-3-642-21204-8_30.

BibTeX
@incollection{le2011algorithms,
  title = {{Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters}},
  author = {Le, Trong Dao and Zhang, Melvin and Leong, Wai Yie},
  booktitle = {Lecture notes in computer science},
  pages = {275--286},
  year = {2011},
  doi = {10.1007/978-3-642-21204-8_30}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers