Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

James Lowey

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Marcel Brun

> Home > Persons > James Lowey

Publications

2007
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/pr/BrunSHLCSD07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pr/BrunSHLCSD07
Marcel Brun, Chao Sima, Jianping Hua, James Lowey, Brent Carroll, Edward Suh, Edward R. Dougherty:
Model-based evaluation of clustering validation measures. Pattern Recognit. 40(3): 807-824 (2007)
[c1]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/biocomp/TembeHMSSBHSSLPC07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/biocomp/TembeHMSSBHSSLPC07
Waibhav Tembe, Nils Homer, Sotiris Mitropanopoulos, Mitchell Storey, Szabolcs Szelinger, Marcel Brun, Matthew J. Huentelman, Edward Suh, Dietrich A. Stephan, James Lowey, John V. Pearson, David W. Craig:
Analysis Software for High-density Pooled Genotyping Data. BIOCOMP 2007: 188-194
2006
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/ChoudharyBHLSD06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/ChoudharyBHLSD06
Ashish Choudhary, Marcel Brun, Jianping Hua, James Lowey, Edward Suh, Edward R. Dougherty:
Genetic test bed for feature selection. Bioinform. 22(7): 837-842 (2006)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.