Special Issue "Algorithms and Molecular Sciences"

Quicklinks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (31 July 2009)

Special Issue Editors

Guest Editor
Prof. Dr. Frank Hsu
Department of Computer & Information Sciences, Fordham University, 340 John Mulcahy Hall, 441 East Fordham Road, Bronx NY 10458, USA
Website: http://www.cis.fordham.edu/faculty/Frank-Hsu.html
E-Mail: hsu@cis.fordham.edu
Interests: combinatorics, algorithms, and optimization; networking theory; computational learning theory, and informatics; biomedical information; information retrieval; information and knowledge management; data mining; multi-sensor; multi-source fusion; information technology; telecommunication infrastructure; implementation strategy

Guest Editor
Dr. Christina Schweikert
Department of Computer & Information Sciences, Fordham University, 328 John Mulcahy Hall, 441 East Fordham Road, Bronx NY 10458, USA
Website: http://www.cis.fordham.edu/faculty/Christina-Schweikert.html
E-Mail: cschweikert@cis.fordham.edu

Special Issue Information

Keywords

  • algorithms and molecular sciences

Published Papers (19 papers)

Algorithms 2009, 2(3), 1155-1176; doi:10.3390/a2031155
Received: 15 July 2009; in revised form: 20 August 2009 / Accepted: 10 September 2009 / Published: 16 September 2009
Show/Hide Abstract | Cited by 1 | PDF Full-text (173 KB)

Algorithms 2009, 2(3), 1045-1068; doi:10.3390/a2031045
Received: 1 July 2009; in revised form: 31 July 2009 / Accepted: 21 August 2009 / Published: 27 August 2009
Show/Hide Abstract | PDF Full-text (386 KB)

Algorithms 2009, 2(2), 850-878; doi:10.3390/a2020850
Received: 5 December 2008; in revised form: 11 May 2009 / Accepted: 28 May 2009 / Published: 9 June 2009
Show/Hide Abstract | PDF Full-text (1016 KB)

Algorithms 2009, 2(2), 790-807; doi:10.3390/a2020790
Received: 16 October 2008; in revised form: 17 April 2009 / Accepted: 7 May 2009 / Published: 3 June 2009
Show/Hide Abstract | PDF Full-text (304 KB)

Algorithms 2009, 2(2), 764-789; doi:10.3390/a2020764
Received: 22 December 2008; in revised form: 12 March 2009 / Accepted: 5 May 2009 / Published: 26 May 2009
Show/Hide Abstract | Cited by 2 | PDF Full-text (1452 KB) | Supplementary Files
abstract graphic

Algorithms 2009, 2(2), 667-691; doi:10.3390/a2020667
Received: 8 January 2009; in revised form: 6 March 2009 / Accepted: 24 March 2009 / Published: 21 April 2009
Show/Hide Abstract | Cited by 5 | PDF Full-text (311 KB)

Algorithms 2009, 2(2), 692-709; doi:10.3390/a2020692
Received: 30 November 2008; in revised form: 8 April 2009 / Accepted: 9 April 2009 / Published: 21 April 2009
Show/Hide Abstract | Cited by 10 | PDF Full-text (465 KB)

Algorithms 2009, 2(2), 638-666; doi:10.3390/a2020638
Received: 20 October 2008; in revised form: 2 February 2009 / Accepted: 26 March 2009 / Published: 3 April 2009
Show/Hide Abstract | Cited by 5 | PDF Full-text (2169 KB)

Algorithms 2009, 2(1), 582-605; doi:10.3390/a2010582
Received: 6 January 2009; Accepted: 17 March 2009 / Published: 24 March 2009
Show/Hide Abstract | Cited by 2 | PDF Full-text (241 KB)

Algorithms 2009, 2(1), 498-517; doi:10.3390/a2010498
Received: 27 October 2008; in revised form: 11 January 2009 / Accepted: 25 February 2009 / Published: 11 March 2009
Show/Hide Abstract | Cited by 1 | PDF Full-text (1685 KB)

Algorithms 2009, 2(1), 429-436; doi:10.3390/a2010429
Received: 1 December 2008; in revised form: 19 January 2009 / Accepted: 27 February 2009 / Published: 10 March 2009
Show/Hide Abstract | PDF Full-text (122 KB)

Algorithms 2009, 2(1), 437-447; doi:10.3390/a2010437
Received: 5 December 2008; in revised form: 15 January 2009 / Accepted: 27 February 2009 / Published: 10 March 2009
Show/Hide Abstract | PDF Full-text (198 KB)

Algorithms 2009, 2(1), 448-469; doi:10.3390/a2010448
Received: 4 December 2008; in revised form: 2 February 2009 / Accepted: 5 March 2009 / Published: 10 March 2009
Show/Hide Abstract | PDF Full-text (1258 KB)

Algorithms 2009, 2(1), 410-428; doi:10.3390/a2010410
Received: 24 November 2008; in revised form: 6 January 2009 / Accepted: 26 February 2009 / Published: 4 March 2009
Show/Hide Abstract | Cited by 4 | PDF Full-text (597 KB)

Algorithms 2009, 2(1), 200-214; doi:10.3390/a2010200
Received: 1 December 2008; in revised form: 16 January 2009 / Accepted: 24 January 2009 / Published: 10 February 2009
Show/Hide Abstract | Cited by 2 | PDF Full-text (1395 KB)

Algorithms 2009, 2(1), 215-226; doi:10.3390/a2010215
Received: 30 October 2008; in revised form: 7 January 2009 / Accepted: 24 January 2009 / Published: 10 February 2009
Show/Hide Abstract | Cited by 3 | PDF Full-text (170 KB)

Algorithms 2009, 2(1), 108-120; doi:10.3390/a2010108
Received: 28 November 2008; in revised form: 20 January 2009 / Accepted: 26 January 2009 / Published: 2 February 2009
Show/Hide Abstract | Cited by 2 | PDF Full-text (1056 KB) | Supplementary Files
abstract graphic

Algorithms 2009, 2(1), 76-92; doi:10.3390/a2010076
Received: 30 November 2008; in revised form: 8 January 2009 / Accepted: 20 January 2009 / Published: 22 January 2009
Show/Hide Abstract | Cited by 2 | PDF Full-text (240 KB)

Algorithms 2008, 1(2), 183-200; doi:10.3390/a1020183
Received: 23 October 2008; in revised form: 23 November 2008 / Accepted: 5 December 2008 / Published: 18 December 2008
Show/Hide Abstract | Cited by 2 | PDF Full-text (312 KB) | Supplementary Files
abstract graphic

Last update: 20 February 2014

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert