Search results for query: *

have a good weekend... & the Dr. Wife too. /*##########################################################################*/ /* BEWARE ONLY TESTED ON LINUX... DUMB & DIRTY CODE FOLLOWS */ /*##########################################################################*/ #include <stdio.h> #include...

I should be perfectly clear here... we are currently counting the whitespace including the end-of-line characters. To change this to only count amino acid postions... comment out line #17 uncomment line #18 and uncomment lines #51-56 the printf statement added in my previous post will now look...

line 18 is currently unprocessed & we're using the whitespace is in the pattern method. change line 17 to read... char pat[256] = &quot;R[ \t\n\r]*.[ \t\n\r]*R[ \t\n\r]*.[ \t\n\r]*.[ \t\n\r]*[ST]&quot;; or rather just change the last [RS] to [ST]. the REG_ICASE flag should handle...

I'n not sure if you want a file position or an amino acid position in the peptide so I've given you both options. The amino acid postion option has been commented out & the file postion option is active. /*##########################################################################*/ /* BEWARE...

nevj, OK some success, good... & I'm learning what I need to... even better! 1) Realize that I'm taking you down a *nixie path. I know some Windows libraries but I'm severly out of practice. In particular, the libraies I use for file i/o may be *nixie only. I'll try & steer clear of this but...

Well, the proggie worked for me on a linux box. I can try on FreeBSD or OpenBSD but not Solaris. Sorry. Let's give it a try. OK I'm compiling with: gcc -o ten ten.c Let's reduce the possible source of errors & shrink this proggie a bit. We can add back functionality later. Try...

as I said I need to learn this stuff so here's a proggie I did for learnin' purposes. I may or may not be what you need. /*##########################################################################*/ /* BEWARE ONLY TESTED ON UNIX... DUMB & DIRTY CODE FOLLOWS */...

or if the &quot;|&quot; char is sometimes there & sometimes not there... while (my $line = <INFILE>){ chomp $line; $line =~ s/\|$//; #replaces chop $line; }

I like that. you're solving the problem given & not potentially imaginary future senarios of what the problem will become. code to study. thx.

in the appendix of the instuction set reference (vol #2) from the intel web site. http://developer.intel.com/design/Pentium4/manuals/ these are rather large pdf files but worth the download if you're serious about asm programming. the instruction set has some oddities due to historical...

compounded when?? aww shucks rather than pretending I know all about interest... how about someone who does know what they're talking about http://mathforum.org/dr.math/faq/faq.interest.html if that doesn't help i'll try & clear things up more but before i do help further you have to post code...

oops that's month = ceil(month);

The ceiling function rounds up. double ceil(double x); month = cail(month);

Matt, BM is *THE* method to use if you're doing exact string matching. However, it starts to lose it's edge when there are wildcards. If you're into that kind of thing have a look at the &quot;agrep&quot; algo or the &quot;shift or&quot; method. both can be adapted for low numbers of mismatches...

Sorry, It's just my &quot;cute&quot; way of refering to any of the myraid forms of unix: Linux, FreeBSD, Solaris Unix, etc. Fair warning: after a quick look-see for regular expression libraries in C it appears that the unix/*nixie world & the Windows world for regualr expression libraries are a...

Knowing the field *very* well I'd bet $$ to donuts that after nevj gives his proggie to Dr. Wife. She is going to say that base E can be replaced by base D here & just change for this & then for that replacement rule (because it's easy to replace some hydrophibic bases)... & the creatures would...

fasta format on protein data? anywho... there are c-libs for doing full blown pattern search in the *nixies. have a look-see at the doc on... #include <fnmatch.h> I haven't gotten around to using it myself yet but it's on my to-do list.

mmm... you're testing seems thorough... I like that. I'm not much on segmented memory models & I don't have dos @ work so I can't test this but it seems to me that you're blowing past the end of your segment. You can test this by printing your addresses out & seeing where it dies. Off-hand...

google? hotbot? yahoo? dogpile?... Here's one http://www.rcollins.org/intel.doc/186Manuals.html

for class you gotta roll your own but i'm not against helping you have three things to check on the year >, =, & <. the < & > conditions you know what to do. it's only on the = clause you have to deal with the month. the month check are analogous & only go to day compare on months = then go...